Testing PageRank algorithms

[wolfram77]

Lets us look into the following algorithms:

• Ligra: A Lightweight Graph Processing Framework for Shared Memory; Shun and Blelloch (2013)
• The problem-based benchmark suite (PBBS), V2; Anderson et al. (2022)
• Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable; Dhulipala et al. (2018)
• Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs; Busato et al. (2018)
• Gunrock: GPU Graph Analytics; Wang et al. (2017) (running now; done)
• The GAP Benchmark Suite; Beamer et al. (2015)
• ParlayLib-a toolkit for parallel algorithms on shared-memory multicore machines; Blelloch et al. (2020)
• Real-Time PageRank on Dynamic Graphs; Sallinen et al. (2023)

[wolfram77]

Measuring affected vertices in each iteration of DF and DF-P PageRank.

Commit , Logs, Sheets