{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:56Z","timestamp":1763468156698,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T00:00:00Z","timestamp":1370822400000},"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":[[2013,6,10]]},"DOI":"10.1145\/2464996.2465441","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"283-292","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Expressing graph algorithms using generalized active messages"],"prefix":"10.1145","author":[{"given":"Nicholas","family":"Edmonds","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremiah","family":"Willcock","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Lumsdaine","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"NVIDIA CUDA Programming Guide 2007.  NVIDIA CUDA Programming Guide 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536261"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370685"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/209937.209958"},{"key":"e_1_3_2_1_6_1","volume-title":"GASNet specification, v1.1. Technical report","author":"Bonachea D.","year":"2002","unstructured":"D. Bonachea . GASNet specification, v1.1. Technical report , University of California at Berkeley , Berkeley, CA, USA , 2002 . D. Bonachea. GASNet specification, v1.1. Technical report, University of California at Berkeley, Berkeley, CA, USA, 2002."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/HIPS.2004.1299190"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094852"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid.2012.105"},{"key":"e_1_3_2_1_12_1","series-title":"LNCS","first-page":"722","volume-title":"Mathematical Foundations of Computer Science","author":"Crauser A.","year":"1998","unstructured":"A. Crauser , K. Mehlhorn , U. Meyer , and P. Sanders . A parallelization of Dijkstra's shortest path algorithm . In Mathematical Foundations of Computer Science , volume 1450 of LNCS , pages 722 -- 731 . Springer , 1998 . A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders. A parallelization of Dijkstra's shortest path algorithm. In Mathematical Foundations of Computer Science, volume 1450 of LNCS, pages 722--731. Springer, 1998."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2246056.2246062"},{"key":"e_1_3_2_1_14_1","volume-title":"May","author":"Deitz S. J.","year":"2010","unstructured":"S. J. Deitz , S.-E. Choi , and D. Iten . Five powerful Chapel idioms , May 2010 . S. J. Deitz, S.-E. Choi, and D. Iten. Five powerful Chapel idioms, May 2010."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020373.2020385"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.2010.5713180"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442549"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645612.663154"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2008.45"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094844"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362692"},{"key":"e_1_3_2_1_24_1","volume-title":"Conference on PGAS Programming Models","author":"Jose J.","year":"2011","unstructured":"J. Jose , S. Potluri , M. Luo , UPC Queues for scalable graph traversals: Design and evaluation on InfiniBand clusters . In Conference on PGAS Programming Models , Oct. 2011 . J. Jose, S. Potluri, M. Luo, et al. UPC Queues for scalable graph traversals: Design and evaluation on InfiniBand clusters. In Conference on PGAS Programming Models, Oct. 2011."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90102-6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375527.1375544"},{"key":"e_1_3_2_1_27_1","volume-title":"Neural Information Processing Systems","author":"Lang K.","year":"2005","unstructured":"K. Lang . Fixing two weaknesses of the spectral method . In Neural Information Processing Systems , 2005 . K. Lang. Fixing two weaknesses of the spectral method. In Neural Information Processing Systems, 2005."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/355841.355847"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_31_1","volume-title":"Sept.","author":"Forum MPI","year":"2009","unstructured":"MPI Forum .textsfMPI : A Message-Passing Interface Standard. v2.2 , Sept. 2009 . MPI Forum.textsfMPI: A Message-Passing Interface Standard. v2.2, Sept. 2009."},{"key":"e_1_3_2_1_32_1","volume-title":"Sept.","author":"Forum MPI","year":"2012","unstructured":"MPI Forum .textsfMPI : A Message-Passing Interface Standard. v3.0 , Sept. 2012 . MPI Forum.textsfMPI: A Message-Passing Interface Standard. v3.0, Sept. 2012."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/289918.289920"},{"key":"e_1_3_2_1_34_1","volume-title":"Specification","author":"Architecture Review Board MP","year":"2011","unstructured":"Open MP Architecture Review Board . OpenMP application program interface . Specification , 2011 . OpenMP Architecture Review Board. OpenMP application program interface. Specification, 2011."},{"key":"e_1_3_2_1_35_1","volume-title":"Stanford","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The PageRank citation ranking: Bringing order to the Web. Technical report , Stanford , November 1998 . L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford, November 1998."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90024-9"},{"key":"e_1_3_2_1_37_1","volume-title":"Graph Separators, with Applications","author":"Rosenberg A. L.","year":"2001","unstructured":"A. L. Rosenberg and L. S. Heath . Graph Separators, with Applications . Kluwer Academic Publishers , Norwell, MA, USA , 2001 . A. L. Rosenberg and L. S. Heath. Graph Separators, with Applications. Kluwer Academic Publishers, Norwell, MA, USA, 2001."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30474-6_20"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90013-X"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654079"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2010.69"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941586"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626406002617"},{"key":"e_1_3_2_1_44_1","volume-title":"Lawrence Berkeley National Laboratory","author":"UPC Consortium","year":"2005","unstructured":"UPC Consortium . UPC Language Spec., v1.2. Technical report , Lawrence Berkeley National Laboratory , 2005 . LBNL- 59208. UPC Consortium. UPC Language Spec., v1.2. Technical report, Lawrence Berkeley National Laboratory, 2005. LBNL-59208."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/139669.140382"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536359"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854273.1854323"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995896.1995934"}],"event":{"name":"ICS'13: International Conference on Supercomputing","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Eugene Oregon USA","acronym":"ICS'13"},"container-title":["Proceedings of the 27th international ACM conference on International conference on supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2464996.2465441","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2464996.2465441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:00Z","timestamp":1750235940000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2464996.2465441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,10]]},"references-count":47,"alternative-id":["10.1145\/2464996.2465441","10.1145\/2464996"],"URL":"https:\/\/doi.org\/10.1145\/2464996.2465441","relation":{},"subject":[],"published":{"date-parts":[[2013,6,10]]},"assertion":[{"value":"2013-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}