MELOPPR: Software/Hardware Co-design for Memory-efficient Low-latency Personalized PageRank
Lixiang Li, Yao Chen, Zacharie Zirnheld, Pan Li, Cong Hao
Abstract
Personalized PageRank (PPR) is a graph algorithm that evaluates the importance of the surrounding nodes from a source node. Widely used in social network related applications such as recommender systems, PPR requires real-time responses (latency) for a better user experience. Existing works either focus on algorithmic optimization for improving precision while neglecting hardware implementations or focus on distributed global graph processing on large-scale systems for improving throughput rather than response time. Optimizing low-latency local PPR algorithm with a tight memory budget on edge devices remains unexplored. In this work, we propose a memory-efficient, low-latency PPR solution, namely MeLoPPR, with largely reduced memory requirement and a flexible trade-off between latency and precision. MeLoPPR is composed of stage decomposition and linear decomposition and exploits the node score sparsity: Through stage and linear decomposition, MeLoPPR breaks the computation on a large graph into a set of smaller sub-graphs, that significantly saves the computation memory; Through sparsity exploitation, MeLoPPR selectively chooses the sub-graphs that contribute the most to the precision to reduce the required computation. In addition, through software/hardware co-design, we propose a hardware implementation on a hybrid CPU and FPGA accelerating platform, that further speeds up the sub-graph computation. We evaluate the proposed MeLoPPR on memory-constrained devices including a personal laptop and Xilinx Kintex-7 KC705 FPGA using six real-world graphs. First, MeLoPPR demonstrates significant memory saving by on CPU and on FPGA. Second, MeLoPPR allows flexible trade-offs between precision and execution time: when the precision is 80%, the speedup on CPU is up to and up to on FPGA; when the precision is around 90%, the speedup is up to on FPGA.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 100f0897-d89f-4d86-b312-633a96d04322Cited by top-tier papers1
Ask how each one uses itRelated papers
- Realtime Top-k Personalized PageRank over Large Graphs on GPUsJieming Shi, Renchi Yang, Tianyuan Jin, Xiaokui Xiao et al.VLDB 2020 · 44 citations
- Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward PushHao Wu, Junhao Gan, Zhewei Wei, Rui ZhangSIGMOD 2021 · 41 citations
- Massively Parallel Algorithms for Personalized PageRankGuanhao Hou, Xingguang Chen, Sibo Wang, Zhewei WeiVLDB 2021 · 46 citations
- Edge-based Local Push for Personalized PageRankHanzhi Wang, Zhewei Wei, Junhao Gan, Ye Yuan et al.VLDB 2022 · 14 citations
- Personalized PageRanks over Dynamic Graphs - The Case for Optimizing Quality of ServiceZulun Zhu, Siqiang Luo, Wenqing Lin, Sibo Wang et al.ICDE 2024 · 4 citations
