Domain-Specialized Cache Management for Graph Analytics
Priyank Faldu, Jeff Diamond, Boris Grot
Abstract
Graph analytics power a range of applications in areas as diverse as finance, networking and business logistics. A common property of graphs used in the domain of graph analytics is a power-law distribution of vertex connectivity, wherein a small number of vertices are responsible for a high fraction of all connections in the graph. These richly-connected, hot, vertices inherently exhibit high reuse. However, this work finds that state-of-the-art hardware cache management schemes struggle in capitalizing on their reuse due to highly irregular access patterns of graph analytics.
In response, we propose GRASP, domain-specialized cache management at the last-level cache for graph analytics. GRASP augments existing cache policies to maximize reuse of hot vertices by protecting them against cache thrashing, while maintaining sufficient flexibility to capture the reuse of other vertices as needed. GRASP keeps hardware cost negligible by leveraging lightweight software support to pinpoint hot vertices, thus eliding the need for storage-intensive prediction mechanisms employed by state-of-the-art cache management schemes. On a set of diverse graph-analytic applications with large high-skew graph datasets, GRASP outperforms prior domain-agnostic schemes on all datapoints, yielding an average speed-up of 4.2% (max 9.4%) over the best-performing prior scheme. GRASP remains robust on low-/no-skew datasets, whereas prior schemes consistently cause a slowdown.
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 960483bd-f211-4d07-9ebb-e96df4a578a7Cited by top-tier papers15
- Ginex: SSD-enabled Billion-scale Graph Neural Network Training on a Single Machine via Provably Optimal In-memory CachingYeonhong Park, Sunhong Min, Jae W. LeeVLDB 2022 · 57 citations
- FlexMiner: A Pattern-Aware Accelerator for Graph Pattern MiningXuhao Chen, Tianhao Huang, Shuotao Xu, Thomas Bourgeat et al.ISCA 2021 · 41 citations
- P-OPT: Practical Optimal Cache Replacement for Graph AnalyticsVignesh Balaji, Neal Clayton Crago, Aamer Jaleel, Brandon LuciaHPCA 2021 · 41 citations
- SpZip: Architectural Support for Effective Data Compression In Irregular ApplicationsYifan Yang, Joel S. Emer, Daniel SánchezISCA 2021 · 31 citations
- Improving Streaming Graph Processing Performance using Input KnowledgeAbanti Basak, Zheng Qu, Jilan Lin, Alaa R. Alameldeen et al.MICRO 2021 · 20 citations
Related papers
- Speeding up SpMV for power-law graph analytics by enhancing locality & vectorizationSerif Yesil, Azin Heidarshenas, Adam Morrison, Josep TorrellasSC 2020 · 28 citations
- GoCache: Accelerating Out-Of-Core Graph Queries with Pattern-Driven CachingZheng Yang, Yicheng Zhang, Lixiao Cui, Luofan Chen et al.ICDE 2026
- CoSPARSE: A Software and Hardware Reconfigurable SpMV Framework for Graph AnalyticsSiying Feng, Jiawen Sun, Subhankar Pal, Xin He et al.DAC 2021 · 19 citations
- GNNIE: GNN inference engine with load-balancing and graph-specific cachingSudipta Mondal, Susmita Dey Manasi, Kishor Kunal, Ramprasath S et al.DAC 2022 · 20 citations
- SaGraph: A Similarity-aware Hardware Accelerator for Temporal Graph ProcessingJin Zhao, Yu Zhang, Jian Cheng, Yiyang Wu et al.DAC 2023 · 6 citations
