Sting: Near-storage accelerator framework for scalable triangle counting and beyond
Open Access
- 23 June 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Abstract
One of the most critical limitations to scalable graph mining is memory capacity, as graphs of interest continue to grow while the rate of DRAM scaling diminishes. While high-performance NVMe storage is cheap and dense enough to better support larger graphs, the relative performance limitations of secondary storage force a cost-performance trade-off. We present STING, which uses an asynchronous callback function to provide a general interface to in-storage graphs while allowing transparent near-storage acceleration. Using triangle counting, we show with transparent filtering and sorting acceleration, STING can improve state-of-the-art by 3x for cost and power efficiency.Keywords
Funding Information
- JUMP 2.0 PRISM: Center for Processing with Intelligent Storage and Memory (000705769)
This publication has 16 references indexed in Scilit:
- Improved Distributed-memory Triangle Counting by Exploiting the Graph Structure2022
- FAST: A Scalable Subgraph Matching Framework over Large Graphs2022
- Towards Distributed Square Counting in Large Graphs2021
- Graph Learning: A SurveyIEEE Transactions on Artificial Intelligence, 2021
- Trust: Triangle Counting Reloaded on GPUsIEEE Transactions on Parallel and Distributed Systems, 2021
- GraFBoost: Using Accelerated Flash Storage for External Graph Analytics2018
- Triangle counting in large networks: a reviewWIREs Data Mining and Knowledge Discovery, 2017
- Exploring optimizations on shared-memory platforms for parallel triangle counting algorithms2017
- Static graph challenge: Subgraph isomorphism2017
- G-Store: High-Performance Graph Store for Trillion-Edge Processing2016