Fast and efficient parallel breadth-first search with power-law graph transformation

Graphical abstract

References

[1] Gonzalez J E, Low Y, Gu H J, Bickson D, Guestrin C. Powergraph: distributed graph-parallel computation on natural graphs. In: Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation. 2012, 17– 30

[2] Sabet A H N , Qiu J Q , Zhao Z J . Tigr: transforming irregular graphs for GPU-friendly graph processing. ACM SIGPLAN Notices, 2018, 53( 2): 622– 636

[3] Azad A, Jacquelin M, Buluç A, Ng E G. The reverse Cuthill-McKee algorithm in distributed-memory. In: Proceedings of IEEE International Parallel and Distributed Processing Symposium. 2017, 22– 31

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

[5] Seo H , Liu Z , Großschädl J , Kim H . Efficient arithmetic on ARM-NEON and its application for high-speed RSA implementation. Security and Communication Networks, 2016, 9( 18): 5401– 5411

[6] Yasui Y, Fujisawa K, Sato Y. Fast and energy-efficient breadth-first search on a single NUMA system. In: Proceedings of the 29th International Conference on Supercomputing. 2014, 365–381

Acknowledgements

This work was partially supported by the Natural Science Foundation of China (Grant Nos. 41930110, 61872272, 61640221).

Supporting Information

The supporting information is available online at journal.hep.com.cn and link.springer.com.

RIGHTS & PERMISSIONS

2022 Higher Education Press