Parallel Heap - An Optimal Parallel Priority Queue
Title - Alternative
PARALLEL DATA STRUCTURE; HEAP; PRIORITY QUEUE; OPTIMAL PARALLEL; ALGORITHM; PARALLEL RANDOM ACCESS MACHINE; TREES; ALGORITHM; SEARCH; Computer Science, Hardware & Architecture; Computer Science, Theory &; Methods; Engineering, Electrical & Electronic
We describe a new parallel data structure, namely parallel heap, for exclusive-read exclusive-write parallel random access machines. To our knowledge, it is the first such data structure to efficiently implement a truly parallel priority queue based on a heap structure. Employing p processors, the parallel heap allows deletions of THETA(p) highest priority items and insertions of THETA(p) new items, each in O(log n) time, where n is the size of the parallel heap. Furthermore, it can efficiently utilize processors in the range 1 through n.
Deo, N and Medidi, M, "Parallel Heap - An Optimal Parallel Priority Queue" (1992). Faculty Bibliography. 2037.