Conference Proceeding Article
Personalized PageRank (PPR) is a well-known proximitymeasure in graphs. To meet the need for dynamic PPRmaintenance, recent works have proposed a local updatescheme to support incremental computation. Nevertheless,sequential execution of the scheme is still too slow for highspeedstream processing. Therefore, we are motivated todesign a parallel approach for dynamic PPR computation.First, as updates always come in batches, we devise a batchprocessing method to reduce synchronization cost among everysingle update and enable more parallelism for iterativeparallel execution. Our theoretical analysis shows that theparallel approach has the same asymptotic complexity asthe sequential approach. Second, we devise novel optimizationtechniques to e↵ectively reduce runtime overheads forparallel processes. Experimental evaluation shows that ourparallel algorithm can achieve orders of magnitude speedupson GPUs and multi-core CPUs compared with the state-ofthe-artsequential algorithm.
Graphics and Human Computer Interfaces
Proceedings of the 44th International Conference on Very Large Data Bases, Rio de Janeiro, Brazil, 2017 September 1
City or Country
Rio de Janeiro, Brazil
GUO, Wentian; LI, Yuchen; LI, Yuchen; and TAN, Kian-Lee.
Parallel personalized pagerank on dynamic graphs. (2017). Proceedings of the 44th International Conference on Very Large Data Bases, Rio de Janeiro, Brazil, 2017 September 1. 11, (1), 93-106. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/3900
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.