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 条
  • [31] Strongly connected components based efficient computation of page rank
    Hongguo Yang
    Derong Shen
    Yue Kou
    Tiezheng Nie
    Ge Yu
    Frontiers of Computer Science, 2018, 12 : 1208 - 1219
  • [32] An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model
    Baswana, Surender
    Choudhary, Keerti
    Roditty, Liam
    ALGORITHMICA, 2019, 81 (03) : 967 - 985
  • [33] 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,
  • [34] A space-efficient algorithm for finding strongly connected components
    Pearce, David J.
    INFORMATION PROCESSING LETTERS, 2016, 116 (01) : 47 - 52
  • [35] 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
  • [36] Distributed parallel support vector machines in strongly connected networks
    Lu, Yumao
    Roychowdhury, Vwani
    Vandenberghe, Lieven
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 2008, 19 (07): : 1167 - 1178
  • [37] Distributed object pose estimation over strongly connected networks
    Lee, Jae-Gyeong
    Van Tran, Quoc
    Oh, Koog-Hwan
    Park, Poo-Gyeon
    Ahn, Hyo-Sung
    SYSTEMS & CONTROL LETTERS, 2023, 175
  • [38] Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components
    Lacki, Jakub
    ACM TRANSACTIONS ON ALGORITHMS, 2013, 9 (03)
  • [39] An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model
    Surender Baswana
    Keerti Choudhary
    Liam Roditty
    Algorithmica, 2019, 81 : 967 - 985
  • [40] GPU Centric Extensions for Parallel Strongly Connected Components Computation
    Devshatwar, Shrinivas
    Amilkanthwar, Madhur
    Nasre, Rupesh
    9TH WORKSHOP ON GENERAL PURPOSE PROCESSING USING GPUS (GPGPU 9), 2016, : 3 - 12
12345