{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:50:17Z","timestamp":1768031417569,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T00:00:00Z","timestamp":1339977600000},"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":[[2012,6,18]]},"DOI":"10.1145\/2287076.2287104","type":"proceedings-article","created":{"date-parts":[[2012,6,20]],"date-time":"2012-06-20T13:33:01Z","timestamp":1340199181000},"page":"149-160","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":62,"title":["Highly scalable graph search for the Graph500 benchmark"],"prefix":"10.1145","author":[{"given":"Koji","family":"Ueno","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology, Tokyo, Japan"}]},{"given":"Toyotaro","family":"Suzumura","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2012,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Graph500 : http:\/\/www.graph500.org\/  Graph500 : http:\/\/www.graph500.org\/"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.34"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.4"},{"key":"e_1_3_2_1_5_1","volume-title":"HPCS Scalable Synthetic Compact Applications #2 Graph Analysis (SSCA#2 v2.2 Specification)","author":"Bader D.A.","year":"2007","unstructured":"D.A. Bader , J. Feo , J. Gilbert , J. Kepner , D. Koester , E. Loh , K. Madduri , W. Mann , and Theresa Meuse , HPCS Scalable Synthetic Compact Applications #2 Graph Analysis (SSCA#2 v2.2 Specification) , 5 September 2007 . D.A. Bader, J. Feo, J. Gilbert, J. Kepner, D. Koester, E. Loh, K. Madduri, W. Mann, and Theresa Meuse, HPCS Scalable Synthetic Compact Applications #2 Graph Analysis (SSCA#2 v2.2 Specification), 5 September 2007."},{"key":"e_1_3_2_1_6_1","series-title":"SIAM Data Mining","volume-title":"R-MAT: A recursive model for graph mining","author":"Chakrabarti D.","year":"2004","unstructured":"D. Chakrabarti , Y. Zhan , and C. Faloutsos , R-MAT: A recursive model for graph mining , SIAM Data Mining 2004 . D. Chakrabarti, Y. Zhan, and C. Faloutsos, R-MAT: A recursive model for graph mining, SIAM Data Mining 2004."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2005.55"},{"key":"e_1_3_2_1_8_1","volume-title":"Parallel Shortest Path Algorithms for Solving Large-Scale Instances,\" 9th DIMACS Implementation Challenge -- The Shortest Path Problem","author":"Madduri K.","year":"2006","unstructured":"K. Madduri , D.A. Bader , J.W. Berry , and J.R. Crobak , \" Parallel Shortest Path Algorithms for Solving Large-Scale Instances,\" 9th DIMACS Implementation Challenge -- The Shortest Path Problem , DIMACS Center , Rutgers University , Piscataway, NJ, November 13--14, 2006 . K. Madduri, D.A. Bader, J.W. Berry, and J.R. Crobak, \"Parallel Shortest Path Algorithms for Solving Large-Scale Instances,\" 9th DIMACS Implementation Challenge -- The Shortest Path Problem, DIMACS Center, Rutgers University, Piscataway, NJ, November 13--14, 2006."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2006.302741"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 14th international conference on High performance computing (HiPC'07)","author":"Harish Pawan","unstructured":"Pawan Harish and P. J. Narayanan . 2007. Accelerating large graph algorithms on the GPU using CUDA . In Proceedings of the 14th international conference on High performance computing (HiPC'07) , Srinivas Aluru, Manish Parashar, Ramamurthy Badrinath, and Viktor K. Prasanna (Eds.). Springer-Verlag, Berlin, Heidelberg, 197--208. Pawan Harish and P. J. Narayanan. 2007. Accelerating large graph algorithms on the GPU using CUDA. In Proceedings of the 14th international conference on High performance computing (HiPC'07), Srinivas Aluru, Manish Parashar, Ramamurthy Badrinath, and Viktor K. Prasanna (Eds.). Springer-Verlag, Berlin, Heidelberg, 197--208."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70811"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103845.1094844"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470353"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564126_17"},{"key":"e_1_3_2_1_17_1","unstructured":"MVAPICH2: http:\/\/mvapich.cse.ohio-state.edu\/  MVAPICH2: http:\/\/mvapich.cse.ohio-state.edu\/"},{"key":"e_1_3_2_1_18_1","unstructured":"OpenMPI : http:\/\/www.open-mpi.org\/  OpenMPI : http:\/\/www.open-mpi.org\/"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2011.6114175"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/582034.582062"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063471"},{"key":"e_1_3_2_1_22_1","first-page":"116","volume-title":"2008 IEEE International Conference on Cluster Computing","author":"Hoefler Torsten","unstructured":"Torsten Hoefler , Timo Schneider , Andrew Lumsdaine . Multistage switches are not crossbars: Effects of static routing in high-performance networks . 2008 IEEE International Conference on Cluster Computing , Tsukuba, Japan. pp. 116 -- 125 . Torsten Hoefler, Timo Schneider, Andrew Lumsdaine. Multistage switches are not crossbars: Effects of static routing in high-performance networks. 2008 IEEE International Conference on Cluster Computing, Tsukuba, Japan. pp.116--125."}],"event":{"name":"HPDC'12: The 21st International Symposium on High-Performance Parallel and Distributed Computing","location":"Delft The Netherlands","acronym":"HPDC'12","sponsor":["University of Arizona University of Arizona","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 21st international symposium on High-Performance Parallel and Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2287076.2287104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2287076.2287104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:04Z","timestamp":1750236544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2287076.2287104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,18]]},"references-count":22,"alternative-id":["10.1145\/2287076.2287104","10.1145\/2287076"],"URL":"https:\/\/doi.org\/10.1145\/2287076.2287104","relation":{},"subject":[],"published":{"date-parts":[[2012,6,18]]},"assertion":[{"value":"2012-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}