Distributed calculation of PageRank using strongly connected components

被引：0
|
作者：
Brinkmeier, Michael [1 ]
机构：
[1] Tech Univ Ilmenau, Inst Tech & Theoret Comp Sci, Ilmenau, Germany
来源：
INNOVATIVE INTERNET COMMUNITY SYSTEMS | 2006年 / 3908卷
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated componentwise, as long as the rankings of pages directly linking to the current component are already known. Depending on the structure of the WWW, this approach approach may be used to calculate the ranking on several components in parallel, and allows to split the problem intio significantly small subproblems.
引用
收藏
页码：29 / 40
页数：12
相关论文
共 50 条
  • [1] Efficient Trimming for Strongly Connected Components Calculation
    Niewenhuis, Dante
    Varbanescu, Ana-Lucia
    PROCEEDINGS OF THE 19TH ACM INTERNATIONAL CONFERENCE ON COMPUTING FRONTIERS 2022 (CF 2022), 2022, : 131 - 140
  • [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] A Distributed Algorithm for Identifying Strongly Connected Components on Incremental Graphs
    Srinivasan, S.
    Khanda, A.
    Srinivasan, S.
    Pandey, A.
    Das, S. K.
    Bhowmick, S.
    Norris, B.
    2023 IEEE 35TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING, SBAC-PAD, 2023, : 109 - 118
  • [4] Isomorphic and strongly connected components
    Miloš S. Kurilić
    Archive for Mathematical Logic, 2015, 54 : 35 - 48
  • [5] Isomorphic and strongly connected components
    Kurilic, Milos S.
    ARCHIVE FOR MATHEMATICAL LOGIC, 2015, 54 (1-2) : 35 - 48
  • [6] Social Network Community Detection Using Strongly Connected Components
    Lee, Wookey
    Lee, James J.
    Kim, Jinho
    TRENDS AND APPLICATIONS IN KNOWLEDGE DISCOVERY AND DATA MINING, 2014, 8643 : 596 - 604
  • [7] A Scalable Distributed Dynamical Systems Approach to Learn the Strongly Connected Components and Diameter of Networks
    Reed, Emily A. A.
    Ramos, Guilherme
    Bogdan, Paul
    Pequito, Sergio
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2023, 68 (05) : 3099 - 3106
  • [8] On identifying strongly connected components in parallel
    Fleischer, LK
    Hendrickson, B
    Pinar, A
    PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 2000, 1800 : 505 - 511
  • [9] Finding strongly connected components in parallel
    Pogorilyy, S. D.
    Lozytskyi, S., I
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2007, 6 (02) : 236 - 245
  • [10] Decremental maintenance of strongly connected components
    Roditty, Liam
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1143 - 1150
12345