A Parallel Priority Data Structure with Applications

We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main application, we give a parallel implementation of Dijkstra's algorithm which runs in On time while performing Omlognwork on a CREW PRAM. This is a logarithmic factor improvement for the running time compared with previous approaches. The main feature of our data structure is that the operations needed in each iteration of Dijkstra's algorithm can be supported in O1 time.

• Type: Conference
• Year: 1997
• Where: IPPS
• Authors: Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis
• Keywords: Data Structure, Dijkstra's Algorithm, Distributed And Parallel Computing, IPPS 1997, Parallel Priority Data