Title :
Parallel heap: improved and simplified
Author :
Prasad, Sushil ; Deo, Narsingh
Author_Institution :
Dept. of Math. & Comput. Sci., Georgia State Univ., Atlanta, GA, USA
Abstract :
Describes a new updated version of the data structure parallel heap. Employing p processors, a parallel heap allows detections of Θ(p) highest-priority items and insertion of Θ( 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
Keywords :
computational complexity; data structures; parallel programming; programming theory; EREW PRAM; data structure; item deletion; item insertion; parallel heap; Binary trees; Computer science; Data structures; Phase change random access memory;
Conference_Titel :
Parallel Processing Symposium, 1992. Proceedings., Sixth International
Conference_Location :
Beverly Hills, CA
Print_ISBN :
0-8186-2672-0
DOI :
10.1109/IPPS.1992.223004
