Home → Magazine Archive → January 1989 (Vol. 32, No. 1) → Concurrent operations on priority queues → Abstract

Concurrent operations on priority queues

By Douglas W. Jones

Communications of the ACM, Vol. 32 No. 1, Pages 132-137

Among the fastest priority queue implementations, skew heaps have properties that make them particularly suited to concurrent manipulation of shared queues. A concurrent version of the top down implementation of skew heaps can be produced from previously published sequential versions using almost mechanical transformations. This implementation requires O(log n) time to enqueue or dequeue an item, but it allows new operations to begin after only O(1) time on a MIMD machine. Thus, there is potential for significant concurrency when multiple processes share a queue. Applications to problems in graph theory and simulation are discussed in this article.

The full text of this article is premium content


No entries found