.png){kind=icon}
Return
A parallel priority queue with constant time operations
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1998.1425.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a parallel priority queue that supports the following operations in constant time: parallel insertion of a sequence of elements ordered according to key, parallel decrease key for a sequence of elements ordered according to key, deletion of the minimum key element, and deletion of an arbitrary element. Our data structure is the first to support multi-insertion and multi-decrease kev in constant time. The priority queue can be implemented on the EREW PRAM and can perform any sequence of n operations in O(n) time and O(m log n) work, m being the total number of keyes inserted and/or updated. A main application is a parallel implementation of Dijkstra's algorithm for the single-source shortest path problem, which runs in O(n) time and O(m log n) work on a CREW PRAM on graphs with n vertices and m edges. This is a logarithmic factor improvement in the running time compared with previous approaches. (C) 1998 Academic Press.
Keywords:
parallel data structures
parallel algorithms
graph algorithms
priority queues
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
ShareSaveExtraction of Uranium and Selected Fission Products from Nitric Acid Medium by Certain Diamides.png)
ract
ractIF0
PREAI
ShareSaveShareSaveShareSaveA charge-modulated FET for detection of biomolecular processes: conception, modeling, and simulation
PREAI
ShareSave
ShareSaveShareSaveShareSave
View more