Parallel Processing Symposium, International (1992)
Beverly Hills, CA, USA
Mar. 23, 1992 to Mar. 26, 1992
Prasad , Dept. of Math. & Comput. Sci., Georgia State Univ., Atlanta, GA, USA
Describes a new updated version of the data structure parallel heap. Employing p processors, a parallel heap allows detections of Theta (p) highest-priority items and insertion of Theta (p) new items each in O(logn) time on an EREW PRAM where n is the size of the parallel heap. Furthermore, it can efficiently utilize processors in the range 1 through n. This version does not require dedicated maintenance processors, and performs insertion and deletion in place.
item deletion, item insertion, data structure, parallel heap, EREW PRAM
Deo and Prasad, "Parallel heap: improved and simplified," Parallel Processing Symposium, International(IPPS), Beverly Hills, CA, USA, 1992, pp. 448-451.