287 search results - page 19 / 58 » Introducing parallelism and concurrency in the data structur... |
DAWAK
2001
Springer
13 years 12 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
PODC
1990
ACM
13 years 11 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
HLPPP
1991
13 years 11 months ago
1991
Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are add...
ICPP
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
CONCUR
2012
Springer
11 years 9 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...