51 search results - page 1 / 11 » Parallel Algorithms for Priority Queue Operations |
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...
JPDC
1998
13 years 4 months ago
1998
COMPUTING
2008
13 years 4 months ago
2008
We introduce two data-structural transformations to construct doubleended priority queues from priority queues. To apply our transformations the priority queues exploited must sup...
WADS
2007
Springer
13 years 10 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...