Parallel Processing Symposium, International (1997)
Apr. 1, 1997 to Apr. 5, 1997
G. Brodal , Dept. of Comput. Sci., Aarhus Univ., Denmark
J. Träff , Dept. of Comput. Sci., Aarhus Univ., Denmark
C. Zaroliagis , Dept. of Comput. Sci., Aarhus Univ., Denmark
Presents 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 (1959) algorithm which runs in O(n) time while performing O(m log n) work 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 O(1) time.
data structures, parallel priority data structure, algorithm running time, parallel implementation, Dijkstra's algorithm, CREW PRAM, iteration, time complexity
J. Träff, G. Brodal and C. Zaroliagis, "A Parallel Priority Data Structure with Applications," Parallel Processing Symposium, International(IPPS), Geneva, SWITZERLAND, 1997, pp. 689.