Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Incrementally Expanding Approach for Updating PageRank on Dynamic Graphs (2401.03256v3)

Published 6 Jan 2024 in cs.DC and cs.PF

Abstract: PageRank is a popular centrality metric that assigns importance to the vertices of a graph based on its neighbors and their score. Efficient parallel algorithms for updating PageRank on dynamic graphs is crucial for various applications, especially as dataset sizes have reached substantial scales. This technical report presents our Dynamic Frontier approach. Given a batch update of edge deletion and insertions, it progressively identifies affected vertices that are likely to change their ranks with minimal overhead. On a server equipped with a 64-core AMD EPYC-7742 processor, our Dynamic Frontier PageRank outperforms Static, Naive-dynamic, and Dynamic Traversal PageRank by 7.8x, 2.9x, and 3.9x respectively - on uniformly random batch updates of size 10-7 |E| to 10-3 |E|. In addition, our approach improves performance at an average rate of 1.8x for every doubling of threads.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. Local partitioning for directed graphs using pagerank. In in Proc. WAW. 166–178.
  2. Fast incremental and personalized pagerank. arXiv preprint arXiv:1006.2880 (2010).
  3. Pagerank on an evolving graph. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. 24–32.
  4. Comparing apples and oranges: normalized pagerank for evolving graphs. In Proceedings of the 16th international conference on world wide web. 1145–1146.
  5. Local methods for estimating pagerank values. In Proceedings of the thirteenth ACM international conference on Information and knowledge management. 381–389.
  6. Towards Exploiting Link Evolution.
  7. Incremental Page Rank Computation on Evolving Graphs. In Special Interest Tracks and Posters of the 14th International Conference on World Wide Web (Chiba, Japan) (WWW ’05). Association for Computing Machinery, New York, NY, USA, 1094–1095. https://doi.org/10.1145/1062745.1062885
  8. Low-latency graph streaming using compressed purely-functional trees. In ACM SIGPLAN PLDI. 918–934.
  9. H. Dubey and N. Khare. 2022. Fast parallel computation of PageRank scores with improved convergence time. IJDMMM 14, 1 (2022), 63–88.
  10. rapidsai/nvgraph. https://github.com/rapidsai/nvgraph/blob/main/cpp/src/pagerank.cu#L149
  11. P. Garg and K. Kothapalli. 2016. STIC-D: Algorithmic Techniques For Efficient Parallel Pagerank Computation on Real-World Graphs. In Proceedings of the 17th International Conference on Distributed Computing and Networking - ICDCN ’16. ACM Press, 1—10.
  12. HyPR: Hybrid Page Ranking on Evolving Graphs. In Proc. IEEE 27th International Conference on High Performance Computing, Data, and Analytics (HiPC). 62–71.
  13. Kyung Soo Kim and Yong Suk Choi. 2015. Incremental iteration method for fast pagerank computation. In Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication. 1–5.
  14. The SuiteSparse matrix collection website interface. The Journal of Open Source Software 4, 35 (Mar 2019), 1244.
  15. A.N. Langville and C.D. Meyer. 2006. A reordering for the PageRank problem. SIAM SISC 27, 6 (2006), 2112–2120.
  16. J. Leskovec and A. Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. (06 2014).
  17. NVIDIA Corporation. 2019. nvGRAPH Library User’s Guide. https://docs.nvidia.com/cuda/archive/10.1/pdf/nvGRAPH_Library.pdf
  18. Efficient pagerank tracking in evolving networks. In Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. 875–884.
  19. The PageRank citation ranking: Bringing order to the web. Technical Report. Stanford InfoLab.
  20. R.P. Pashikanti and S. Kundu. 2022. FPPR: fast pessimistic (dynamic) PageRank to update PageRank in evolving directed graphs on network changes. SNAM 12, 1 (2022), 141.
  21. S.J. Plimpton and K.D. Devine. 2011. MapReduce in MPI for large-scale graph algorithms. Parallel Comput. 37, 9 (2011), 610–632.
  22. Dynamic Batch Parallel Algorithms for Updating PageRank. In 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 1129–1138.
  23. Fast Distributed PageRank Computation. In Distributed Computing and Networking. Springer Berlin Heidelberg, Berlin, Heidelberg, 11–26.
  24. Fast incremental pagerank on dynamic networks. In International Conference on Web Engineering. Springer, 154–168.
  25. T. Zhang. 2017. Efficient incremental pagerank of evolving graphs on GPU. In IEEE ICCSEC. 1232–1236.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets