195 search results - page 1 / 39 » Lock-Free Parallel Algorithms: An Experimental Study |
HIPC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
OPODIS
2004
13 years 6 months ago
2004
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
JPDC
1998
13 years 4 months ago
1998
IEEEHPCS
2010
13 years 3 months ago
2010
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...