Sciweavers

164 search results - page 7 / 33
» Primitives for Contract-based Synchronization
Sort
View
IPPS
2009
IEEE
15 years 4 months ago
Early experiences on accelerating Dijkstra's algorithm using transactional memory
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
Nikos Anastopoulos, Konstantinos Nikas, Georgios I...
DAMON
2009
Springer
15 years 4 months ago
A new look at the roles of spinning and blocking
Database engines face growing scalability challenges as core counts exponentially increase each processor generation, and the efficiency of synchronization primitives used to prot...
Ryan Johnson, Manos Athanassoulis, Radu Stoica, An...
SENSYS
2010
ACM
14 years 8 months ago
Design and evaluation of a versatile and efficient receiver-initiated link layer for low-power wireless
We present A-MAC, a receiver-initiated link layer for low-power wireless networks that supports several services under a unified architecture, and does so more efficiently and sca...
Prabal Dutta, Stephen Dawson-Haggerty, Yin Chen, C...
EGH
2009
Springer
14 years 8 months ago
Efficient stream compaction on wide SIMD many-core architectures
Stream compaction is a common parallel primitive used to remove unwanted elements in sparse data. This allows highly parallel algorithms to maintain performance over several proce...
Markus Billeter, Ola Olsson, Ulf Assarsson
WCET
2010
14 years 8 months ago
Towards WCET Analysis of Multicore Architectures Using UPPAAL
To take full advantage of the increasingly used shared-memory multicore architectures, software algorithms will need to be parallelized over multiple threads. This means that thre...
Andreas Gustavsson, Andreas Ermedahl, Björn L...