Written by @pagerank | Published on 2025-01-22T18:30:12.077Z
TL;DR →
Dynamic Frontier PageRank demonstrates robust strong-scaling behavior for batch updates, achieving an average speedup of 10.3× with 16 threads and 15.2× with 64 threads. It gains a 1.8× performance boost with every doubling of threads but faces NUMA limitations at higher thread counts. The method efficiently handles dynamic graph updates, scaling well across datasets and graph sizes.
Author:
(1) Subhajit Sahu, IIIT Hyderabad, Hyderabad, Telangana, India ([email protected]).
Table of Links
Abstract and 1 Introduction
2 Related Work
3 Preliminaries
4 Approach
5.1 Experimental Setup
5.2 Performance of Dynamic Frontier PageRank
5.3 Strong Scaling of Dynamic Frontier PageRan
6 Conclusion, Acknowledgments, and References
5.3 Strong Scaling of Dynamic Frontier PageRan
This story on HackerNoon has a decentralized backup on
Sia.
Meta Data:
📄