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 条
  • [41] DNA Algorithm on Making Spanning Tree Problem
    Kang, Zhou
    Yufang, Huang
    Zhen, Cheng
    Jin, Xu
    2009 FOURTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PROCEEDINGS, 2009, : 1 - +
  • [42] INCREMENTAL DISTRIBUTED ASYNCHRONOUS ALGORITHM FOR MINIMUM SPANNING-TREES
    TSIN, YH
    COMPUTER NETWORKS AND ISDN SYSTEMS, 1993, 26 (02): : 227 - 232
  • [43] The distributed spanning tree: A scalable interconnection topology for efficient and equitable traversal
    Dahan, S
    Nicod, JM
    Philippe, L
    2005 IEEE INTERNATIONAL SYMPOSIUM ON CLUSTER COMPUTING AND THE GRID, VOLS 1 AND 2, 2005, : 243 - 250
  • [44] Improvised Tree Selection Algorithm in Greedy Distributed Spanning Tree Routing
    Das, Debasis
    Misra, Rajiv
    2014 RECENT ADVANCES IN ENGINEERING AND COMPUTATIONAL SCIENCES (RAECS), 2014,
  • [45] An application of the minimal spanning tree approach to the cluster stability problem
    Z. Volkovich
    Z. Barzily
    G.-W. Weber
    D. Toledano-Kitai
    R. Avros
    Central European Journal of Operations Research, 2012, 20 : 119 - 139
  • [46] An application of the minimal spanning tree approach to the cluster stability problem
    Volkovich, Z.
    Barzily, Z.
    Weber, G. -W.
    Toledano-Kitai, D.
    Avros, R.
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2012, 20 (01) : 119 - 139
  • [47] MINIMAL SPANNING TREE ANALYSIS OF REGULAR, RANDOM AND CLUSTER STRUCTURES
    DUSSERT, C
    RASIGNI, G
    RASIGNI, M
    PALMARI, J
    LLEBARIA, A
    ZEITSCHRIFT FUR PHYSIK D-ATOMS MOLECULES AND CLUSTERS, 1989, 12 (1-4): : 41 - 44
  • [48] Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
    Mashreghi, Ali
    King, Valerie
    DISTRIBUTED COMPUTING, 2021, 34 (04) : 283 - 299
  • [49] Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
    Ali Mashreghi
    Valerie King
    Distributed Computing, 2021, 34 : 283 - 299
  • [50] New Algorithm Permitting the Construction of an Effective Spanning Tree
    Belkacem, Salima Nait
    Abbas, Moncef
    FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2023, 48 (03) : 313 - 329
12345