An efficient memory data organization strategy for application-characteristic graph processing

Peng FANG; Fang WANG; Zhan SHI; Dan FENG; Qianxu YI; Xianghao XU; Yongxuan ZHANG

doi:10.1007/s11704-020-0255-y

Front. Comput. Sci. ›› 2022, Vol. 16 ›› Issue (1) : 161607 DOI: 10.1007/s11704-020-0255-y

Information Systems

LETTER

An efficient memory data organization strategy for application-characteristic graph processing

Author information +

History +

PDF (858KB)

Cite this article

Download citation ▾

Peng FANG, Fang WANG, Zhan SHI, Dan FENG, Qianxu YI, Xianghao XU, Yongxuan ZHANG. An efficient memory data organization strategy for application-characteristic graph processing. Front. Comput. Sci., 2022, 16(1): 161607 DOI:10.1007/s11704-020-0255-y

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	Balaji V, Lucia B. When is graph reordering an optimization? Studying the effect of lightweight graph reordering across applications and input graphs. In: Proceedings of IEEE International Symposium on Workload Characterization. 2018, 203–214

[2]	Wei H, Yu J X, Lu C, Lin X M. Speedup graph processing by graph ordering. In: Proceedings of ACM International Conference on Management of Data. 2016, 1813–1828

[3]	Shan Y X, Shi Z, Feng D, Mengyun O, Wang F. Cache-friendly data layout for massive graph. In: Proceedings of IEEE International Conference on Networking Architecture and Storages. 2018, 1–4

[4]	Pearce R, Gokhale M, Amato N M. Multithreaded asynchronous graph traversal for in-memory and semi-external memory. In: Proceedings of ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis. 2010, 1–11

[5]	Karantasis K I, Lenharth A, Nguyen D, Garzarán M J, Pingalik. Parallelization of reordering algorithms for bandwidth and wavefront reduction. In: Proceedings of International Conference for High Performance Computing, Networking, Storage and Analysis. 2014, 921–932

[6]	Liu X, Murata T. Advanced modularity-specialized label propagation algorithm for detecting communities in networks. Physica A: Statistical Mechanics and its Applications, 2010, 389(7): 1493–1500

[7]	Arai J, Shiokawa H, Yamamuro T, Onizuka M, Lwamura S. Rabbit order: just-in-time parallel reordering for fast graph analysis. In: Proceedings of IEEE International Parallel and Distributed Processing Symposium. 2016, 22–31

[8]	Kyrola A, Blelloch G, Guestrin C. GraphChi: large-scale graph computation on Just a PC. In: Proceedings of USENIX Conference on Operating Systems Design and Implementation. 2012, 31–46

[9]	Zhu X W, Han W T, Chen W G. Gridgraph: large-scale graph processing on a single machine using 2-level hierarchical partitioning. In: Proceedings of Usenix Conference on Usenix Technical Conference. 2015, 375–386