Finding strongly connected components in parallel

被引：0
|
作者：
Pogorilyy, S. D. [1 ]
Lozytskyi, S., I [1 ]
机构：
[1] Taras Shevchenko Natl Univ Kiev, Fac Radiphis, UA-03680 Kiev, Ukraine
来源：
APPLIED AND COMPUTATIONAL MATHEMATICS | 2007年 / 6卷 / 02期
关键词：
Tarjan's algorithm; strongly connected component; depth-first search; formal theories of algorithms; paralleling of an algorithm;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper presents the method of a parallel implementation of Tarjan's algorithm that solves an important problem of detection of strongly connected components in a directed graph. A theoretical synthesis of the corresponding scheme of the algorithm is done with the means of systems of modified algorithmic algebras developed by V.M.Glushkov (SAA-M). Theoretical estimations of the speedup of the algorithm are obtained. These estimations have been checked up and confirmed in the experiment.
引用
收藏
页码：236 / 245
页数：10
相关论文
共 50 条
  • [1] On identifying strongly connected components in parallel
    Fleischer, LK
    Hendrickson, B
    Pinar, A
    PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 2000, 1800 : 505 - 511
  • [2] Finding strongly connected components in distributed graphs
    McLendon, W
    Hendrickson, B
    Plimpton, SJ
    Rauchwerger, L
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2005, 65 (08) : 901 - 910
  • [3] ON FINDING THE STRONGLY CONNECTED COMPONENTS IN A DIRECTED GRAPH
    NUUTILA, E
    SOISALONSOININEN, E
    INFORMATION PROCESSING LETTERS, 1994, 49 (01) : 9 - 14
  • [4] SCCMulti An Improved Parallel Strongly Connected Components Algorithm
    Tomkins, Daniel
    Smith, Timmie
    Amato, Nancy M.
    Rauchwerger, Lawrence
    ACM SIGPLAN NOTICES, 2014, 49 (08) : 393 - 394
  • [5] Orchestrating parallel detection of strongly connected components on GPUs
    Chen, Xuhao
    Chen, Cheng
    Shen, Jie
    Fang, Jianbin
    Tang, Tao
    Yang, Canqun
    Wang, Zhiying
    PARALLEL COMPUTING, 2018, 78 : 101 - 114
  • [6] Finding Strongly Connected Components in Parallel using O(log2 n) Reachability Queries
    Schudy, Warren
    SPAA'08: PROCEEDINGS OF THE TWENTIETH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2008, : 146 - 151
  • [7] FINDING CONNECTED COMPONENTS AND CONNECTED ONES ON A MESH-CONNECTED PARALLEL COMPUTER
    NASSIMI, D
    SAHNI, S
    SIAM JOURNAL ON COMPUTING, 1980, 9 (04) : 744 - 757
  • [8] A space-efficient algorithm for finding strongly connected components
    Pearce, David J.
    INFORMATION PROCESSING LETTERS, 2016, 116 (01) : 47 - 52
  • [9] A dynamic optimal stabilizing algorithm for finding strongly connected components
    Karaata, MH
    Al-Anzi, F
    KUWAIT JOURNAL OF SCIENCE & ENGINEERING, 2002, 29 (02): : 259 - 275
  • [10] ISPAN: Parallel Identification of Strongly Connected Components with Spanning Trees
    Ji, Yuede
    Liu, Hang
    Huang, H. Howie
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE, AND ANALYSIS (SC'18), 2018,
12345