Issue No. 12 - December (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.9744
Contention for the shared heap limits the obtainable speedup in parallel algorithms using this data structure as a priority queue. An approach that allows concurrent insertions and deletions on the heap in a shared-memory multiprocessor is presented. The scheme retains the strict priority ordering of the serial-access heap algorithms, i.e. a delete operation returns the best key of all keys tha
priority queues; shared heap; parallel algorithms; data structure; shared-memory multiprocessor; BBN Butterfly parallel processor; concurrent-heap algorithms; parallel branch-and-bound; multiprocessing systems; parallel algorithms; queueing theory.
R. Nageshwara and V. Kumar, "Concurrent Access of Priority Queues," in IEEE Transactions on Computers, vol. 37, no. , pp. 1657-1665, 1988.