Parallel heap: A practical priority queue for fine-to-medium-grained applications on small multiprocessors
Parallel and Distributed Processing, IEEE Symposium on (1995)
San Antonio, Texas
Oct. 25, 1995 to Oct. 28, 1995
S.K. Prasad , Dept. of Math. & Comput. Sci., Georgia State Univ., Atlanta, GA, USA
S.I. Sawant , Dept. of Math. & Comput. Sci., Georgia State Univ., Atlanta, GA, USA
We present an efficient implementation of the parallel heap data structure on a bus-based Silicon Graphics multiprocessor GTX/4D. Parallel heap is theoretically the first heap-based data structure to have implemented an optimally scalable parallel priority queue on an exclusive-read exclusive-write parallel random access machine. We compared it with Rao-and-Kumar's concurrent heap and with the conventional serial heap accessed via a lock. The parallel heap outperformed others for fine-to-medium grains achieving speedups of two to four using six processors relative to the best sequential execution times. The concurrent heap, however, exhibited performance comparable only to the serial heap. As expected for coarser grain, the serial heap performed at par with or better than others.
data structures; parallel programming; queueing theory; priority queue; fine-to-medium-grained; multiprocessors; parallel heap data structure; Silicon Graphics multiprocessor; GTX/4D; serial heap; concurrent heap; scalable parallel priority queue
S. Prasad and S. Sawant, "Parallel heap: A practical priority queue for fine-to-medium-grained applications on small multiprocessors," Parallel and Distributed Processing, IEEE Symposium on(SPDP), San Antonio, Texas, 1995, pp. 328.