Abstract
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. We propose a new p-processor BSP algorithm for the all-pairs shortest paths problem in a weighted directed dense graph. In contrast with the general algebraic path algorithm, which performs O(p1/2) to O(p2/3) global synchronisation steps, our new algorithm only requires O(log p) synchronisation steps. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Tiskin, A. (2001). All-pairs shortest paths computation in the BSP model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2076 LNCS, pp. 178–189). Springer Verlag. https://doi.org/10.1007/3-540-48224-5_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
