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 条

[1] A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPS)
Bader, DA
Cong, GJ
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2005, 65 (09) : 994 - 1006
[2] CciMST: A Clustering Algorithm Based on Minimum Spanning Tree and Cluster Centers
Lv, Xiaobo
Ma, Yan
He, Xiaofu
Huang, Hui
Yang, Jie
MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018
[3] A HIGHLY ASYNCHRONOUS MINIMUM SPANNING TREE PROTOCOL
SINGH, G
BERNSTEIN, AJ
DISTRIBUTED COMPUTING, 1995, 8 (03) : 151 - 161
[4] Parallelizing EM clustering algorithm on a cluster of SMPs
Glimcher, L
Agrawal, G
EURO-PAR 2004 PARALLEL PROCESSING, PROCEEDINGS, 2004, 3149 : 372 - 380
[5] Cluster counting: The Hoshen-Kopelman algorithm versus spanning tree approaches
Babalievski, F
INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 1998, 9 (01): : 43 - 60
[6] A DISTRIBUTED SPANNING TREE ALGORITHM
JOHANSEN, KE
JORGENSEN, UL
NIELSEN, SH
NIELSEN, SE
SKYUM, S
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 312 : 1 - 12
[7] VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim Clustering Algorithm
Kponyo, Jerry John
Kuang, Yujun
Zhang, Enzhan
Domenic, Kamenyi
2013 INTERNATIONAL CONFERENCE ON COMPUTATIONAL PROBLEM-SOLVING (ICCP), 2013, : 101 - 104
[8] An Asynchronous Distributed Algorithm for Constructing a Connected Dominating Set Optimized by Minimum-Weight Spanning Tree
Ren, Sijun
Yi, Ping
Wu, Yue
Li, Jianhua
2014 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE), 2014, : 1205 - 1212
[9] An optimal minimum spanning tree algorithm
Pettie, S
Ramachandran, V
JOURNAL OF THE ACM, 2002, 49 (01) : 16 - 34
[10] An optimal minimum spanning tree algorithm
Pettie, S
Ramachandran, V
AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 49 - 60

← 1 2 3 4 5 →