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 条

[21] A Scalable Asynchronous Distributed Algorithm for Topic Modeling
Yu, Hsiang-Fu
Hsieh, Cho-Jui
Yun, Hyokun
Vishwanathan, S. V. N.
Dhillon, Inderjit S.
PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW 2015), 2015, : 1340 - 1350
[22] On a Minimal Spanning, Tree Approach in the Cluster Validation Problem
Barzily, Zeev
Volkovich, Zeev
Akteke-Oeztuerk, Basak
Weber, Gerhard-Wilhelm
INFORMATICA, 2009, 20 (02) : 187 - 202
[23] A minimum spanning tree equipartition algorithm for microaggregation
Panagiotakis, Costas
Tziritas, Georgios
JOURNAL OF APPLIED STATISTICS, 2015, 42 (04) : 846 - 865
[24] An approximation algorithm for maximum internal spanning tree
Zhi-Zhong Chen
Youta Harada
Fei Guo
Lusheng Wang
Journal of Combinatorial Optimization, 2018, 35 : 955 - 979
[25] A FULLY DISTRIBUTED (MINIMAL) SPANNING TREE ALGORITHM
LAVALLEE, I
ROUCAIROL, G
INFORMATION PROCESSING LETTERS, 1986, 23 (02) : 55 - 62
[26] An algorithm for inverse minimum spanning tree problem
Zhang, JH
Xu, SJ
Ma, ZF
OPTIMIZATION METHODS & SOFTWARE, 1997, 8 (01): : 69 - 84
[27] Clustering Based Minimum Spanning Tree Algorithm
Saxena, Sakshi
Verma, Priyanka
Rajpoot, Dharmveer Singh
2017 TENTH INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING (IC3), 2017, : 360 - 362
[28] EFFICIENT ALGORITHM FOR COMMON SPANNING TREE PROBLEM
SCHACH, SR
ELECTRONICS LETTERS, 1983, 19 (09) : 346 - 347
[29] An Approximation Algorithm for Maximum Internal Spanning Tree
Chen, Zhi-Zhong
Harada, Youta
Guo, Fei
Wang, Lusheng
WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017, 2017, 10167 : 385 - 396
[30] Design and performance of SMPs with asynchronous caches
Pong, Fong
Dubois, Michel
Lee, Ken
HP Laboratories Technical Report, 1999, (149):

← 1 2 3 4 5 →