Affiliation:
1. School of Software, Soongsil University, Seoul 06978, Republic of Korea
Abstract
Personalized PageRank (PPR) is a widely used graph processing algorithm used to calculate the importance of source nodes in a graph. Generally, PPR is executed by using a high-performance microprocessor of a server, but it needs to be executed on edge devices to guarantee data privacy and network latency. However, since PPR has a variety of computation/memory characteristics that vary depending on the graph datasets, it causes performance/energy inefficiency when it is executed on edge devices with limited hardware resources. In this paper, we propose HedgeRank, a heterogeneity-aware, energy-efficient, partitioning technique of personalized PageRank at the edge. HedgeRank partitions the PPR subprocesses and allocates them to appropriate edge devices by considering their computation capability and energy efficiency. When combining low-power and high-performance edge devices, HedgeRank improves the execution time and energy consumption of PPR execution by up to 26.7% and 15.2% compared to the state-of-the-art PPR technique.
Funder
National Research Foundation of Korea
MSIT
Subject
Electrical and Electronic Engineering,Mechanical Engineering,Control and Systems Engineering
Reference29 articles.
1. A Survey on Personalized PageRank Computation Algorithms;Park;Access,2019
2. Jeh, G., and Widom, J. (2003, January 20–24). Scaling Personalized Web Search. Proceedings of the 12th International Conference on World Wide Web, Budapest, Hungary.
3. Decoupling the Depth and Scope of Graph Neural Networks;Zeng;Adv. Neural Inf. Process. Syst.,2021
4. Chien, E., Peng, J., Li, P., and Milenkovic, O. (2020). Adaptive universal generalized pagerank graph neural network. arXiv, preprint.
5. Zhang, H., Li, X., Li, Z., Huang, D., and Zhang, L. (2023). Estimation of Particle Location in Granular Materials Based on Graph Neural Networks. Micromachines, 14.