405 search results - page 1 / 81 » A Parallel Priority Data Structure with Applications |
IPPS
1997
IEEE
13 years 8 months ago
1997
IEEE
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
SWAT
1992
Springer
13 years 8 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
ISORC
2003
IEEE
13 years 10 months ago
2003
IEEE
: Structuring real-time concurrent programs in the form of groups of fixed-priority processes is an old art which is appropriate for only a small fraction of modern real-time distr...
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 ...
IPPS
1997
IEEE
13 years 8 months ago
1997
IEEE
