This research demonstrates a new parallel data structure for priority queues, highlighting its efficiency and scalability.
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.
No takes yet. Share an insight, caveat, or question.
A 1992 study studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: