Sciweavers

2609 search results - page 413 / 522
» Optimizing for parallelism and data locality
Sort
View
106
Voted
PPOPP
2009
ACM
16 years 1 months ago
Detecting and tolerating asymmetric races
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
Paruj Ratanaworabhan, Martin Burtscher, Darko Kiro...
119
Voted
TPHOL
2009
IEEE
15 years 7 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
113
Voted
EUROPAR
2009
Springer
15 years 7 months ago
Adaptive Peer Sampling with Newscast
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
Norbert Tölgyesi, Márk Jelasity
122
Voted
CLUSTER
2002
IEEE
15 years 14 days ago
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
Susanta Datta, Ivan Stojmenovic, Jie Wu
PDP
2011
IEEE
14 years 4 months ago
Quantifying Thread Vulnerability for Multicore Architectures
Abstract—Continuously reducing transistor sizes and aggressive low power operating modes employed by modern architectures tend to increase transient error rates. Concurrently, mu...
Isil Oz, Haluk Rahmi Topcuoglu, Mahmut T. Kandemir...