A robust, efficient, and balanced parallel algorithm for finding connected components

被引:0
|
作者
Asokan, M. [1 ]
机构
[1] Syncsort Inc, Pearl River, NY 10965 USA
关键词
Graph Mining; Connected Components; Hadoop; MapReduce; MAPREDUCE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Finding connected components in an undirected graph has many practical applications. For example in a graph representing a social network, a connected component represents a group of related individuals with common interest. Also, finding connected components forms the basis for other clustering algorithms. In this paper, we will present a parallel algorithm which uses the well known sequential algorithm as the basis for finding connected components in an undirected graph. The algorithm can be adopted to run on a single computer with multiple cores or MapReduce. It is robust in the sense that it honors memory limits. This is important in today's containerized environments. It balances the workload even in the presence of data skew. For the best known algorithm running in MapReduce, the number of iterations is the square of the logarithmic function of the number of vertices in the graph. For our algorithm, we will prove that the upper bound on the number of iterations is a logarithmic function of the maximum size of a connected component. In each iteration, the amount of data read from or written to a file system is bounded by four times the number of edges in the graph.
引用
收藏
页码:2113 / 2118
页数:6
相关论文
共 50 条
  • [31] LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory
    Azad, Ariful
    Buluc, Aydin
    2019 IEEE 33RD INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2019), 2019, : 2 - 12
  • [32] Finding connected components in digital images
    Khanna, V
    Gupta, P
    Hwang, CJ
    INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, PROCEEDINGS, 2001, : 652 - 656
  • [33] Numerical algorithm for finding balanced metrics
    Sano, Yuji
    OSAKA JOURNAL OF MATHEMATICS, 2006, 43 (03) : 679 - 688
  • [34] An Efficient and Robust Algorithm for Parallel Groupwise Registration of Bone Surfaces
    van de Giessen, Martijn
    Vos, Frans M.
    Grimbergen, Cornelis A.
    van Vliet, Lucas J.
    Streekstra, Geert J.
    MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2012, PT III, 2012, 7512 : 164 - 171
  • [35] An efficient parallel algorithm for finding the (k, l)-center of tree networks
    Wang, Deqiang
    Li, Yuanhui
    Wang, Yan
    Wang, Kelun
    PROCEEDINGS OF THE 18TH IASTED INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING AND SYSTEMS, 2006, : 422 - +
  • [36] AN EFFICIENT PARALLEL ALGORITHM FOR FINDING RECTANGULAR DUALS OF PLANE TRIANGULAR GRAPHS
    HE, X
    ALGORITHMICA, 1995, 13 (06) : 553 - 572
  • [37] A Granulation Strategy-Based Algorithm for Computing Strongly Connected Components in Parallel
    He, Huixing
    Xu, Taihua
    Chen, Jianjun
    Cui, Yun
    Song, Jingjing
    MATHEMATICS, 2024, 12 (11)
  • [38] Efficient algorithm for obtaining connected components in bi-level images
    Liu, Yan
    Gu, Guoqing
    IEICE ELECTRONICS EXPRESS, 2014, 11 (03):
  • [39] A NEW CLASS OF PARALLEL ALGORITHMS FOR FINDING CONNECTED COMPONENTS ON MACHINES WITH BIT-VECTOR OPERATIONS
    LIANG, Y
    DHALL, SK
    LAKSHMIVARAHAN, S
    INFORMATION SCIENCES, 1994, 76 (3-4) : 177 - 195
  • [40] Diagnosis of wiring networks: An optimal randomized algorithm for finding connected components of unknown graphs
    Shi, WP
    West, DB
    SIAM JOURNAL ON COMPUTING, 1999, 28 (05) : 1541 - 1551