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 条
  • [41] Implicit enumeration of strongly connected components and an application to formal verification
    Xie, AG
    Beerel, PA
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2000, 19 (10) : 1225 - 1230
  • [42] ISPAN: Parallel Identification of Strongly Connected Components with Spanning Trees
    Ji, Yuede
    Liu, Hang
    Hu, Yang
    Huang, H. Howie
    ACM TRANSACTIONS ON PARALLEL COMPUTING, 2022, 9 (03)
  • [43] An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model
    Department of Computer Science and Engineering, IIT, Kanpur, India
    不详
    Algorithmica, 3 (967-985):
  • [44] Computing strongly connected components in a linear number of symbolic steps
    Gentilini, R
    Piazza, C
    Policriti, A
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 573 - 582
  • [45] CALCULATION OF TRANSIENTS IN A SYSTEM OF ALGEBRAICALLY CONNECTED DYNAMIC COMPONENTS USING A NEW NUMERICAL ALGORITHM
    SEMLYEN, A
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1975, CA22 (07): : 622 - 628
  • [46] Communication-efficient Massively Distributed Connected Components
    Lamm, Sebastian
    Sanders, Peter
    2022 IEEE 36TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2022), 2022, : 302 - 312
  • [47] Distributed computing connected components with linear communication cost
    Feng, Xing
    Chang, Lijun
    Lin, Xuemin
    Qin, Lu
    Zhang, Wenjie
    Yuan, Long
    DISTRIBUTED AND PARALLEL DATABASES, 2018, 36 (03) : 555 - 592
  • [48] Distributed computing connected components with linear communication cost
    Xing Feng
    Lijun Chang
    Xuemin Lin
    Lu Qin
    Wenjie Zhang
    Long Yuan
    Distributed and Parallel Databases, 2018, 36 : 555 - 592
  • [49] Comparative Study of PageRank Calculation
    Barboucha, Hamza
    Sefraoui, Omar
    Ghoumid, Kamal
    PROCEEDINGS OF THE 1ST INTERNATIONAL CONFERENCE ON ELECTRONIC ENGINEERING AND RENEWABLE ENERGY, ICEERE 2018, 2019, 519 : 58 - 68
  • [50] 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
12345