Name
Abstract | ||
|---|---|---|
In the domain of graph analytics, power-law graphs are prevalent. In such graphs, a small fraction of vertices are responsible for a large share of all graph connections. These richly-connected (hot) vertices inherently exhibit high reuse. However, this work finds that the 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 argue in favor of leveraging software knowledge of graph data structures to accurately pinpoint hot vertices in hardware. To that end, we propose GRASP, a domain-specialized LLC management scheme that enables high cache efficiency for graph analytics with minimal modifications to existing cache structures. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/PACT.2019.00051 | 2019 28th International Conference on Parallel Architectures and Compilation Techniques (PACT) |
Keywords | Field | DocType |
cache replacement,graph analytics,domain specialized design | Metadata,Data structure,GRASP,Vertex (geometry),Cache,Reuse,Computer science,Parallel computing,Theoretical computer science,Graph analytics,Software | Conference |
ISSN | ISBN | Citations |
1089-795X | 978-1-7281-3614-1 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Priyank Faldu | 1 | 4 | 0.72 |
| Jeff Diamond | 2 | 4 | 0.72 |
| Boris Grot | 3 | 748 | 35.18 |