Concurrent operations on priority queues

Journal Article · Sat Dec 31 23:00:00 EST 1988 · Commun. ACM; (United States)

DOI:https://doi.org/10.1145/63238.63249· OSTI ID:5871864

Jones, D W

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.

• Research Organization: 3348000
• OSTI ID: 5871864
• Journal Information: Commun. ACM; (United States), Journal Name: Commun. ACM; (United States) Vol. 32:1; ISSN CACMA
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ARRAY PROCESSORS
COMPUTERIZED SIMULATION
DATA
DATA TRANSMISSION SYSTEMS
GRAPHS
IMPLEMENTATION
INFORMATION
NUMERICAL DATA
QUEUES
SIMULATION
THEORETICAL DATA