Cache-efficient fork-processing patterns on large graphs
As large graph processing emerges, we observe a costly fork-processing pattern (FPP) that is common in many graph algorithms. The unique feature of the FPP is that it launches many independent queries from different source vertices on the same graph. For example, an algorithm in analyzing the networ...
Saved in:
Main Authors: | LU, Shengliang, SUN, Shixuan, PAUL, Johns, LI, Yuchen, HE, Bingsheng |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/6136 https://ink.library.smu.edu.sg/context/sis_research/article/7139/viewcontent/3448016.3457253.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A project study of the manufacturing and marketing of center-forks in the Philippines
by: Santos, Jess M., et al.
Published: (1977) -
Optimizing complex queries with multiple relation instances
by: Cao, Y., et al.
Published: (2013) -
Graph neural point process for temporal interaction prediction
by: XIA, Wenwen, et al.
Published: (2023) -
Why and how developers fork what from whom in GitHub
by: JIANG, Jing, et al.
Published: (2017) -
A survey of typical attributed graph queries
by: WANG, Yanhao, et al.
Published: (2020)