{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:52:34Z","timestamp":1762955554059,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T00:00:00Z","timestamp":1464652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,5,31]]},"DOI":"10.1145\/2915516.2915522","type":"proceedings-article","created":{"date-parts":[[2016,5,27]],"date-time":"2016-05-27T12:37:36Z","timestamp":1464352656000},"page":"19-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["NUMA-aware Scalable Graph Traversal on SGI UV Systems"],"prefix":"10.1145","author":[{"given":"Yuichiro","family":"Yasui","sequence":"first","affiliation":[{"name":"Kyushu University, Fukuoka, Japan"}]},{"given":"Katsuki","family":"Fujisawa","sequence":"additional","affiliation":[{"name":"Kyushu University, Fukuoka, Japan"}]},{"given":"Eng Lim","family":"Goh","sequence":"additional","affiliation":[{"name":"Silicon Graphics International Corp., Milpitas, CA, USA"}]},{"given":"John","family":"Baron","sequence":"additional","affiliation":[{"name":"Silicon Graphics International Corp., Milpitas, CA, USA"}]},{"given":"Atsushi","family":"Sugiura","sequence":"additional","affiliation":[{"name":"Silicon Graphics International Corp., Milpitas, CA, USA"}]},{"given":"Takashi","family":"Uchiyama","sequence":"additional","affiliation":[{"name":"SGI Japan, Ltd., Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2016,5,31]]},"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","volume-title":"Proceedings of the ACM\/IEEE Int. Conf. High Performance Computing, Networking, Storage and Analysis (SC12)","author":"Beamer S.","year":"2012","unstructured":"S. Beamer , K. Asanovc , and D.A. Patterson . Direction-optimizing breadth- rst search . In Proceedings of the ACM\/IEEE Int. Conf. High Performance Computing, Networking, Storage and Analysis (SC12) , 2012 . S. Beamer, K. Asanovc, and D.A. Patterson. Direction-optimizing breadth- rst search. In Proceedings of the ACM\/IEEE Int. Conf. High Performance Computing, Networking, Storage and Analysis (SC12), 2012."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2010.67"},{"key":"e_1_3_2_1_5_1","volume-title":"Introduction to Algorithms","author":"Cormen T.","year":"1990","unstructured":"T. Cormen , C. Leiserson , and R. Rivest . Introduction to Algorithms . MIT Press , Cambridge MA , 1990 . T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, Cambridge MA, 1990."},{"key":"e_1_3_2_1_6_1","first-page":"1277","article-title":"Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation","volume":"11","author":"Dinic E. A.","year":"1970","unstructured":"E. A. Dinic . Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation . Soviet Math Doklady , 11 : 1277 -- 1280 , 1970 E. A. Dinic. Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation. Soviet Math Doklady, 11:1277--1280, 1970","journal-title":"Soviet Math Doklady"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389125"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.121"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_1_11_1","unstructured":"T. Hoeffer. GreenGraph500 Submission Rules http:\/\/green.graph500.org\/greengraph500rules.pdf.  T. Hoeffer. GreenGraph500 Submission Rules http:\/\/green.graph500.org\/greengraph500rules.pdf."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1155\/2010\/185421"},{"key":"e_1_3_2_1_13_1","unstructured":"Intel(R) C++ Compiler XE 16.0 User and Reference Guide Intel Thread Affinity Interface.  Intel(R) C++ Compiler XE 16.0 User and Reference Guide Intel Thread Affinity Interface."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756039"},{"key":"e_1_3_2_1_15_1","volume-title":"Scaling runtimes for irregular algorithms to large-scale NUMA systems. Computer","author":"Lenharth A.","year":"2015","unstructured":"A. Lenharth and K. Pingali . Scaling runtimes for irregular algorithms to large-scale NUMA systems. Computer , IEEE Computer Society , 48(8), 2015 . A. Lenharth and K. Pingali. Scaling runtimes for irregular algorithms to large-scale NUMA systems. Computer, IEEE Computer Society, 48(8), 2015."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the Cray User Group 2010","author":"Murphy R.C.","year":"2010","unstructured":"R.C. Murphy , K.B. Wheeler , B.W. Barrett , and J.A. Ang . Introducing the Graph500 , In Proceedings of the Cray User Group 2010 , 2010 . R.C. Murphy, K.B. Wheeler, B.W. Barrett, and J.A. Ang. Introducing the Graph500, In Proceedings of the Cray User Group 2010, 2010."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPPW.2010.38"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2287076.2287104"},{"issue":"4","key":"e_1_3_2_1_19_1","first-page":"259","article-title":"NETAL: High-performance implementation of network analysis library considering computer memory hierarchy","volume":"54","author":"Yasui Y.","year":"2011","unstructured":"Y. Yasui , K. Fujisawa , K. Goto , N. Kamiyama , and M. Takamatsu . NETAL: High-performance implementation of network analysis library considering computer memory hierarchy . J. Oper. Res. Soc. Japan , 54 ( 4 ): 259 -- 280 , 2011 . Y. Yasui, K. Fujisawa, K. Goto, N. Kamiyama, and M. Takamatsu. NETAL: High-performance implementation of network analysis library considering computer memory hierarchy. J. Oper. Res. Soc. Japan, 54(4):259--280, 2011.","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691600"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07518-1_23"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCSim.2015.7237065"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688507"}],"event":{"name":"HPDC'16: The 25th International Symposium on High-Performance Parallel and Distributed Computing","sponsor":["University of Arizona University of Arizona","SIGARCH ACM Special Interest Group on Computer Architecture","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Kyoto Japan","acronym":"HPDC'16"},"container-title":["Proceedings of the ACM Workshop on High Performance Graph Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2915516.2915522","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2915516.2915522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:18Z","timestamp":1750222578000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2915516.2915522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,31]]},"references-count":23,"alternative-id":["10.1145\/2915516.2915522","10.1145\/2915516"],"URL":"https:\/\/doi.org\/10.1145\/2915516.2915522","relation":{},"subject":[],"published":{"date-parts":[[2016,5,31]]},"assertion":[{"value":"2016-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}