{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:06:11Z","timestamp":1750309571217,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["No.2022YFB4500405"],"award-info":[{"award-number":["No.2022YFB4500405"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 62174162"],"award-info":[{"award-number":["No. 62174162"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1145\/3711708.3723445","type":"proceedings-article","created":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T12:33:27Z","timestamp":1746189207000},"page":"14-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["HisOrder: A Historical Frontier-Aware Graph Reordering for Efficient BFS"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5178-324X","authenticated-orcid":false,"given":"Xinmiao","family":"Zhang","sequence":"first","affiliation":[{"name":"SKLP, Institute of Computing Technology, CAS, Beijing, China"},{"name":"University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7466-3443","authenticated-orcid":false,"given":"Xiaorong","family":"Qin","sequence":"additional","affiliation":[{"name":"Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, CAS, Beijing, China"},{"name":"University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9711-8758","authenticated-orcid":false,"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[{"name":"SKLP, Institute of Computing Technology, CAS, Beijing, China"},{"name":"University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5542-7306","authenticated-orcid":false,"given":"Cheng","family":"Liu","sequence":"additional","affiliation":[{"name":"SKLP, Institute of Computing Technology, CAS, Beijing, China"},{"name":"University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,5,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.110"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602569_48"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2018.8573478"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC50251.2020.00031"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/702694"},{"key":"e_1_3_2_1_6_1","volume-title":"The GAP benchmark suite. arXiv preprint arXiv:1508.03619","author":"Beamer Scott","year":"2015","unstructured":"Scott Beamer, Krste Asanovi\u0107, and David Patterson. 2015. The GAP benchmark suite. arXiv preprint arXiv:1508.03619 (2015)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3105323"},{"key":"e_1_3_2_1_8_1","volume-title":"Pasgal: Parallel and scalable graph algorithm library. arXiv preprint arXiv:2404.17101","author":"Dong Xiaojun","year":"2024","unstructured":"Xiaojun Dong, Yan Gu, Yihan Sun, and Letong Wang. 2024. Pasgal: Parallel and scalable graph algorithm library. arXiv preprint arXiv:2404.17101 (2024)."},{"key":"e_1_3_2_1_9_1","volume-title":"2021 IEEE International Symposium on Workload Characterization (IISWC). IEEE, 101--112","author":"Esfahani Mohsen Koohi","year":"2021","unstructured":"Mohsen Koohi Esfahani, Peter Kilpatrick, and Hans Vandierendonck. 2021. Locality analysis of graph reordering algorithms. In 2021 IEEE International Symposium on Workload Characterization (IISWC). IEEE, 101--112."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC47752.2019.9041948"},{"volume-title":"Structure preserved graph reordering for fast graph processing without the pain. In 2020 IEEE 22nd International Conference on High Performance Computing and Communications","author":"Huang Baofu","key":"e_1_3_2_1_11_1","unstructured":"Baofu Huang, Zhidan Liu, and Kaishun Wu. 2020. Structure preserved graph reordering for fast graph processing without the pain. In 2020 IEEE 22nd International Conference on High Performance Computing and Communications; IEEE 18th International Conference on Smart City; IEEE 6th International Conference on Data Science and Systems (HPCC\/SmartCity\/DSS). IEEE, 44--51."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2017.00039"},{"key":"e_1_3_2_1_13_1","volume-title":"2019 USENIX Annual Technical Conference (USENIX ATC 19)","author":"Lee Eunjae","year":"2019","unstructured":"Eunjae Lee, Junghyun Kim, Keunhak Lim, Sam H Noh, and Jiwon Seo. 2019. {Pre-Select} Static Caching and Neighborhood Ordering for {BFS-like } Algorithms on Disk-based Graph Engines. In 2019 USENIX Annual Technical Conference (USENIX ATC 19). 459--474."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2320716"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_1_16_1","first-page":"428","article-title":"Speedup breadth-first search by graph ordering","volume":"15","author":"Lyu Qiuyi","year":"2021","unstructured":"Qiuyi Lyu and Bin Gong. 2021. Speedup breadth-first search by graph ordering. International Journal of Computer and Information Engineering 15, 7 (2021), 428--435.","journal-title":"International Journal of Computer and Information Engineering"},{"key":"e_1_3_2_1_17_1","volume-title":"International Conference on Parallel Computing, ParCo","volume":"32","author":"Ngu\u00e9l\u00e9 Thomas Messi","year":"2017","unstructured":"Thomas Messi Ngu\u00e9l\u00e9, Maurice Tchuente, and Jean-Fran\u00e7ois M\u00e9haut. 2017. Using Complex-Network properties For Efficient Graph Analysis. In International Conference on Parallel Computing, ParCo 2017, Vol. 32. IOS Press Ebooks, 413--422."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295703"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915220"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8257937"}],"event":{"name":"FCPC '25: 1st FastCode Programming Challenge","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"The Westin Las Vegas Hotel & Spa Las Vegas NV USA","acronym":"FCPC '25"},"container-title":["Proceedings of the 1st FastCode Programming Challenge"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711708.3723445","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711708.3723445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:19:15Z","timestamp":1750295955000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711708.3723445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":20,"alternative-id":["10.1145\/3711708.3723445","10.1145\/3711708"],"URL":"https:\/\/doi.org\/10.1145\/3711708.3723445","relation":{},"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"2025-05-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}