{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:39Z","timestamp":1772163999278,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,2,12]],"date-time":"2011-02-12T00:00:00Z","timestamp":1297468800000},"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":[[2011,2,12]]},"DOI":"10.1145\/1941553.1941601","type":"proceedings-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T13:31:03Z","timestamp":1297776663000},"page":"305-306","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Active pebbles"],"prefix":"10.1145","author":[{"given":"Jeremiah James","family":"Willcock","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas Gerard","family":"Edmonds","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":[[2011,2,12]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"52","volume-title":"The Cascade High Productivity Language. In Ninth Intl. Workshop on High-Level Par. Prog. Models and Supportive Environments","author":"Callahan D.","year":"2004","unstructured":"D. Callahan , B. L. Chamberlain , and H. P. Zima . The Cascade High Productivity Language. In Ninth Intl. Workshop on High-Level Par. Prog. Models and Supportive Environments , pages 52 -- 60 , April 2004 . D. Callahan, B. L. Chamberlain, and H. P. Zima. The Cascade High Productivity Language. In Ninth Intl. Workshop on High-Level Par. Prog. Models and Supportive Environments, pages 52--60, April 2004."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094852"},{"key":"e_1_3_2_1_3_1","volume-title":"Goa","author":"Edmonds N.","year":"2010","unstructured":"N. Edmonds , T. Hoefler , and A. Lumsdaine . A space-efficient parallel algorithm for computing betweenness centrality in distributed memory. In Int.l Conf. on High Performance Computing , Goa , India , Dec. 2010 . N. Edmonds, T. Hoefler, and A. Lumsdaine. A space-efficient parallel algorithm for computing betweenness centrality in distributed memory. In Int.l Conf. on High Performance Computing, Goa, India, Dec. 2010."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01782776"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/289918.289920"},{"key":"e_1_3_2_1_7_1","volume-title":"Lawrence Berkeley National Laboratory","author":"UPC Consortium","year":"2005","unstructured":"UPC Consortium . UPC Language Specifications, v1.2. Technical report , Lawrence Berkeley National Laboratory , 2005 . LBNL- 59208. UPC Consortium. UPC Language Specifications, v1.2. Technical report, Lawrence Berkeley National Laboratory, 2005. LBNL-59208."}],"event":{"name":"PPoPP '11: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"San Antonio TX USA","acronym":"PPoPP '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 16th ACM symposium on Principles and practice of parallel programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1941553.1941601","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1941553.1941601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:59:36Z","timestamp":1750229976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1941553.1941601"}},"subtitle":["a programming model for highly parallel fine-grained data-driven computations"],"short-title":[],"issued":{"date-parts":[[2011,2,12]]},"references-count":7,"alternative-id":["10.1145\/1941553.1941601","10.1145\/1941553"],"URL":"https:\/\/doi.org\/10.1145\/1941553.1941601","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2038037.1941601","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,2,12]]},"assertion":[{"value":"2011-02-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}