A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment

被引：0
|
作者：
Srinivasan, T. [1 ]
Balakrishnan, R. [1 ]
Gangadharan, S. A. [1 ]
Hayawardh, V [1 ]
机构：
[1] Sri Venkateswara Coll Engn, Dept Comp Sci & Engn, Pennalur 602105, Sriperambudur, India
来源：
2007 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, VOLS 1 AND 2 | 2007年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We present a parallelization of the Floyd-Warshall all pairs shortest path algorithm for a distributed environment. A lot of versions of the Floyd-Warshall algorithm have been proposed for a uniprocessor environment, optimizing cache performance and register usage. However, in a distributed environment, communication costs between nodes have to be taken into consideration. We present a novel algorithm, Phased Floyd-Warshall, for a distributed environment, which optimally overlaps computation and communication. Our algorithm is compared with a register optimized version of the blocked all pairs shortest path algorithm [6, 4, 1] which is adapted for a distributed environment. We report speedups of 2.8 in a 16-node cluster and 1.2 in a 32-node cluster for a matrix size of 4096.
引用
收藏
页码：403 / 410
页数：8
相关论文
共 50 条
  • [41] Efficient Parallel All-Pairs Shortest Paths Algorithm for Complex Graph Analysis
    Kim, Jong Wook
    Choi, Hyoeun
    Bae, Seung-Hee
    47TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP '18), 2018,
  • [42] Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units
    Hanif, Muhammad Kashif
    Zimmermann, Karl-Heinz
    Anees, Asad
    MULTIMEDIA TOOLS AND APPLICATIONS, 2022, 81 (07) : 9549 - 9566
  • [43] An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks
    Misra, S
    Oommen, BJ
    IEEE TRANSACTIONS ON COMPUTERS, 2006, 55 (06) : 686 - 702
  • [44] Solving all-pairs shortest path by single-source computations: Theory and practice
    Brodnik, Andrej
    Grgurovic, Marko
    DISCRETE APPLIED MATHEMATICS, 2017, 231 : 119 - 130
  • [45] Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds
    Chen, Justin Y.
    Ghazi, Badih
    Kumar, Ravi
    Manurangsi, Pasin
    Narayanan, Shyam
    Nelson, Jelani
    Xu, Yinzhan
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 5040 - 5067
  • [46] Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units
    Muhammad Kashif Hanif
    Karl-Heinz Zimmermann
    Asad Anees
    Multimedia Tools and Applications, 2022, 81 : 9549 - 9566
  • [47] Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
    Nasre, Meghana
    Pontecorvi, Matteo
    Ramachandran, Vijaya
    ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 766 - 778
  • [48] OpenMP's Asynchronous Offloading for All-pairs Shortest Path Graph Algorithms on GPUs
    Thavappiragasam, Mathialakan
    Kale, Vivek
    2022 IEEE/ACM INTERNATIONAL WORKSHOP ON HIERARCHICAL PARALLELISM FOR EXASCALE COMPUTING (HIPAR), 2022, : 1 - 11
  • [49] All-Pairs Shortest Path algorithms for planar graph for GPU-accelerated clusters
    Djidjev, Hristo
    Chapuis, Guillaume
    Andonov, Rumen
    Thulasidasan, Sunil
    Lavenier, Dominique
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2015, 85 : 91 - 103
  • [50] All-Pairs Shortest Paths with a Sublinear Additive Error
    Roditty, Liam
    Shapira, Asaf
    ACM TRANSACTIONS ON ALGORITHMS, 2011, 7 (04)
12345