An efficient algorithm for concurrent priority queue heaps

Information Processing Letters

Volumn 60, Issue 3, 1996, Pages 151-157

  Hunt, Galen C ^a   Michael, Maged M ^a   Parthasarathy, Srinivasan ^a   Scott, Michael L ^a  

^a University of Rochester   (United States)

Author keywords

Bit reversal; Concurrency; Data structures; Heap; Priority queue; Synchronization

Indexed keywords

ALGORITHMS; CONCURRENCY CONTROL; MULTIPROCESSING SYSTEMS; QUEUEING THEORY; SYNCHRONIZATION; TREES (MATHEMATICS);

PRIORITY QUEUES;

DATA STRUCTURES;

EID: 0030290704     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00148-2     Document Type: Article

References (7)

1. J. Biswas and J.C. Browne, Simultaneous update of priority structures, in: Proc. 1987 Internat. Conf. on Parallel Processing, St. Charles, IL (1987) 124-131.
2. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, MA, 1990).
3. D.W. Jones, Concurrent operations on priority queues, Comm. ACM 32 (1) (1989) 132-137.
4. J.M. Mellor-Crummey and M.L. Scott, Algorithms for scalable synchronization on shared-memory multiprocessors, ACM Trans. Comput. Systems 9 (1) (1991) 21-65.
5. J. Mohan, Experience with two parallel programs solving the travelling salesman problem, in: Proc. 1983 Internat. Conf. on Parallel Processing (1983) 191-193.
6. M.J. Quinn and N. Deo, Parallel graph algorithms, ACM Comput. Surveys 16 (3) (1984) 319-348.
7. V.N. Rao and V. Kumar, Concurrent access of priority queues, IEEE Trans. Comput. 37 (12) (1988) 1657-1665.