{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:32:01Z","timestamp":1768030321924,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100007601","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["732631"],"award-info":[{"award-number":["732631"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,29]]},"DOI":"10.1145\/3392717.3392753","type":"proceedings-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T18:49:02Z","timestamp":1593456542000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Graptor"],"prefix":"10.1145","author":[{"given":"Hans","family":"Vandierendonck","sequence":"first","affiliation":[{"name":"Queen's University Belfast, Belfast, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3307681.3326609"},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Direction-optimizing Breadth-first Search. In Proc. of the Intl. Conference on High Performance Computing","volume":"12","author":"Beamer S.","year":"2012","unstructured":"S. Beamer , K. Asanovi\u0107 , and D. Patterson . 2012 . Direction-optimizing Breadth-first Search. In Proc. of the Intl. Conference on High Performance Computing , Networking, Storage and Analysis. 12 : 1 -- 12 :10. S. Beamer, K. Asanovi\u0107, and D. Patterson. 2012. Direction-optimizing Breadth-first Search. In Proc. of the Intl. Conference on High Performance Computing, Networking, Storage and Analysis. 12:1--12:10.","journal-title":"Networking, Storage and Analysis."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2833179.2833187"},{"key":"e_1_3_2_1_5_1","volume-title":"Workload Characterization (IISWC), 2015 IEEE International Symposium on. IEEE, 56--65","author":"Beamer S.","unstructured":"S. Beamer , K. Asanovi\u0107 , and D. Patterson . 2015. Locality exists in graph processing: Workload characterization on an Ivy Bridge server . In Workload Characterization (IISWC), 2015 IEEE International Symposium on. IEEE, 56--65 . S. Beamer, K. Asanovi\u0107, and D. Patterson. 2015. Locality exists in graph processing: Workload characterization on an Ivy Bridge server. In Workload Characterization (IISWC), 2015 IEEE International Symposium on. IEEE, 56--65."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.93"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312058"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.88"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342014524240"},{"key":"e_1_3_2_1_11_1","unstructured":"E. A. Golovina A. S. Semenov and A. S. Frolov. 2014. Performance Evaluation of Breadth-First Search on Intel Xeon Phi. Vychislitel'nye Metody i Programmirovanie 15 1 (2014) 49--48.  E. A. Golovina A. S. Semenov and A. S. Frolov. 2014. Performance Evaluation of Breadth-First Search on Intel Xeon Phi. Vychislitel'nye Metody i Programmirovanie 15 1 (2014) 49--48."},{"key":"e_1_3_2_1_12_1","series-title":"SIAM J. Appl. Math. (1969), 416--429","volume-title":"Bounds on Multiprocessing Timing Anomalies","author":"Graham R. L.","unstructured":"R. L. Graham . 1969. Bounds on Multiprocessing Timing Anomalies . SIAM J. Appl. Math. (1969), 416--429 . R. L. Graham. 1969. Bounds on Multiprocessing Timing Anomalies. SIAM J. Appl. Math. (1969), 416--429."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755580"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178506"},{"key":"e_1_3_2_1_15_1","volume-title":"Parallel Architectures and Compilation Techniques (PACT), 2011 International Conference on. IEEE, 78--88","author":"Hong S.","unstructured":"S. Hong , T. Oguntebi , and K. Olukotun . 2011. Efficient parallel graph exploration on multi-core CPU and GPU . In Parallel Architectures and Compilation Techniques (PACT), 2011 International Conference on. IEEE, 78--88 . S. Hong, T. Oguntebi, and K. Olukotun. 2011. Efficient parallel graph exploration on multi-core CPU and GPU. In Parallel Architectures and Compilation Techniques (PACT), 2011 International Conference on. IEEE, 78--88."},{"key":"e_1_3_2_1_16_1","unstructured":"Intel 2015. Intel Architecture Instruction Set Extensions Programming Reference. 319433--023.  Intel 2015. Intel Architecture Instruction Set Extensions Programming Reference. 319433--023."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926285"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921632.1921634"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/130930352"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2017.7995269"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2751205.2751209"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 2017 USENIX Conference on Usenix Annual Technical Conference (USENIX ATC '17). USENIX Association","author":"Malicevic J.","unstructured":"J. Malicevic , B. Lepers , and W. Zwaenepoel . 2017. Everything You Always Wanted to Know About Multicore Graph Processing but Were Afraid to Ask . In Proceedings of the 2017 USENIX Conference on Usenix Annual Technical Conference (USENIX ATC '17). USENIX Association , Berkeley, CA, USA, 631--643. http:\/\/dl.acm.org\/citation.cfm?id=3154690.3154750 J. Malicevic, B. Lepers, and W. Zwaenepoel. 2017. Everything You Always Wanted to Know About Multicore Graph Processing but Were Afraid to Ask. In Proceedings of the 2017 USENIX Conference on Usenix Annual Technical Conference (USENIX ATC '17). USENIX Association, Berkeley, CA, USA, 631--643. http:\/\/dl.acm.org\/citation.cfm?id=3154690.3154750"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060829"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295716"},{"key":"e_1_3_2_1_26_1","unstructured":"L. Page S. Brin R. Motwani and T. Winograd. 1999. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report. Stanford InfoLab.  L. Page S. Brin R. Motwani and T. Winograd. 1999. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report. Stanford InfoLab."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2903150.2903180"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.44"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.07.006"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2012.204"},{"key":"e_1_3_2_1_31_1","volume-title":"Proc of ACM Symp. on Principles and Practice of Parallel Programming. 135--146","author":"Shun J.","unstructured":"J. Shun and G. E. Blelloch . 2013. Ligra: A Lightweight Graph Processing Framework for Shared Memory . In Proc of ACM Symp. on Principles and Practice of Parallel Programming. 135--146 . J. Shun and G. E. Blelloch. 2013. Ligra: A Lightweight Graph Processing Framework for Shared Memory. In Proc of ACM Symp. on Principles and Practice of Parallel Programming. 135--146."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2016.25"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2017.35"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2017.27"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079079.3079097"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295703"},{"key":"e_1_3_2_1_37_1","unstructured":"K. Thomas. 2019. Using Cray Systems with Knights Landing Processors. https:\/\/www.nersc.gov\/assets\/Uploads\/Using-KNL-Processors-Feb2019.pdf.  K. Thomas. 2019. Using Cray Systems with Knights Landing Processors. https:\/\/www.nersc.gov\/assets\/Uploads\/Using-KNL-Processors-Feb2019.pdf."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295733"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3168818"},{"key":"e_1_3_2_1_40_1","volume-title":"Proc. of ACM Symp. on Principles and Practice of Parallel Programming. 183--193","author":"Zhang K.","unstructured":"K. Zhang , R. Chen , and H. Chen . 2015. NUMA-aware graph-structured analytics . In Proc. of ACM Symp. on Principles and Practice of Parallel Programming. 183--193 . K. Zhang, R. Chen, and H. Chen. 2015. NUMA-aware graph-structured analytics. In Proc. of ACM Symp. on Principles and Practice of Parallel Programming. 183--193."},{"key":"e_1_3_2_1_41_1","unstructured":"Y. Zhang M. Yang R. Baghadi S. Kamil J. Shun and A. Amarasinghe. 2018. GraphIt - A High-Performance DSL for Graph Analytics. eprint arXiv:1805.00923 (June 2018).  Y. Zhang M. Yang R. Baghadi S. Kamil J. Shun and A. Amarasinghe. 2018. GraphIt - A High-Performance DSL for Graph Analytics. eprint arXiv:1805.00923 (June 2018)."}],"event":{"name":"ICS '20: 2020 International Conference on Supercomputing","location":"Barcelona Spain","acronym":"ICS '20","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 34th ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3392717.3392753","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3392717.3392753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:15Z","timestamp":1750200075000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3392717.3392753"}},"subtitle":["efficient pull and push style vectorized graph processing"],"short-title":[],"issued":{"date-parts":[[2020,6,29]]},"references-count":41,"alternative-id":["10.1145\/3392717.3392753","10.1145\/3392717"],"URL":"https:\/\/doi.org\/10.1145\/3392717.3392753","relation":{},"subject":[],"published":{"date-parts":[[2020,6,29]]},"assertion":[{"value":"2020-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}