A scalable, asynchronous spanning tree algorithm on a cluster of SMPs

被引：0
|
作者：
Cong, Guojing [1 ]
Xue, Hanhong [2 ]
机构：
[1] IBM Res Corp, Yorktown Hts, NY 10598 USA
[2] IBM Syst & Technol Grp, Poughkeepsie, NY USA
来源：
2008 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-8 | 2008年
关键词：
spanning tree; cluster; symmetric multiprocessors; breadth-first search; depth-first search;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Large-scale data science applications require manipulating large graphs distributed across multiple processors. In this paper we present our experimental study of an asynchronous, distributed spanning tree algorithm that handles the challenging random, sparse graphs with billions of vertices. With a constant number of barriers, our implementation scales to 1024 processors on a cluster of SMPs. Our algorithm sheds new light on the design and implementation of graph algorithms on distributed-memory machines.
引用
收藏
页码：2182 / +
页数：2
相关论文
共 50 条
  • [31] A parallel algorithm for minimum spanning tree on GPU
    de Alencar Vasconcellos, Jucele Franca
    Caceres, Edson Norberto
    Mongelli, Henrique
    Song, Siang Wun
    2017 INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING WORKSHOPS (SBAC-PADW), 2017, : 67 - 72
  • [32] An approximation algorithm for maximum internal spanning tree
    Chen, Zhi-Zhong
    Harada, Youta
    Guo, Fei
    Wang, Lusheng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (03) : 955 - 979
  • [33] Minimum spanning tree partitioning algorithm for microaggregation
    Laszlo, M
    Mukherjee, S
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (07) : 902 - 911
  • [34] A faster algorithm for the inverse spanning tree problem
    Ahuja, RK
    Orlin, JB
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2000, 34 (01): : 177 - 193
  • [35] Spanning tree algorithm for spare network capacity
    Szymanski, L
    Yang, OWW
    CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING 2001, VOLS I AND II, CONFERENCE PROCEEDINGS, 2001, : 447 - 452
  • [36] Kernelization algorithm of Maximum Leaf Spanning Tree
    Gao W.-Y.
    Jisuanji Xuebao/Chinese Journal of Computers, 2010, 33 (12): : 2211 - 2218
  • [37] A simpler minimum spanning tree verification algorithm
    King, V
    ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 440 - 448
  • [38] Image registration with minimum spanning tree algorithm
    Ma, B
    Hero, A
    Gorman, J
    Michel, O
    2000 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL I, PROCEEDINGS, 2000, : 481 - 484
  • [39] A simpler minimum spanning tree verification algorithm
    King, V
    ALGORITHMICA, 1997, 18 (02) : 263 - 270
  • [40] A simpler minimum spanning tree verification algorithm
    V. King
    Algorithmica, 1997, 18 : 263 - 270
12345