Conclusion
In this paper, we focus on the memory data organization strategy based on application operating characteristics and present GMDO, an efficient memory data organization strategy composed of GMDO-VR and GMDO-VI for traversal and iterative graph applications, respectively. Extensive experiments show that GMDO exhibits remarkable performance compares with the representative schemes. For state-of-the-art graph systems, our proposed strategy can significantly improve the system acceleration ratio and increase the cache hit ratio.
This is a preview of subscription content, log in via an institution to check access.
References
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
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
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
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
Karantasis K I, Lenharth A, Nguyen D, Garzarán M J, Pingalik. Paral-lelization of reordering algorithms for bandwidth and wavefront reduction. In: Proceedings of International Conference for High Performance Computing, Networking, Storage and Analysis. 2014, 921–932
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
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
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
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
Acknowledgements
This work was supported by NSFC (Grant Nos. 61772216, 82090044, 61832020 and 61821003).
Author information
Authors and Affiliations
Corresponding author
Additional information
Supporting information
The supporting information was available online at journal.hep.com.cn and link.springer.com.
Electronic Supplementary Material
Rights and permissions
About this article
Cite this article
Fang, P., Wang, F., Shi, Z. et al. An efficient memory data organization strategy for application-characteristic graph processing. Front. Comput. Sci. 16, 161607 (2022). https://doi.org/10.1007/s11704-020-0255-y
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11704-020-0255-y