Database Paper Browser

Back to papers

Cache-Efficient Fork-Processing Patterns on Large Graphs

Summary: FPP on large graphs suffers cache misses on multi-core systems. ForkGraph partitions graphs into LLC-sized blocks, buffers FPP queries per partition, and uses cache-resident sequential processing with intra- and inter-partition scheduling (yielding and priority-based), achieving work-efficiency and large speedups over Ligra, Gemini, GraphIt. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6144
Venue
SIGMOD
Year
2021
Pagerank
5.2307519e-05
Overall Rank
6,059 | 57.85%
DOI
10.1145/3448016.3457253

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers