{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:52Z","timestamp":1772164012926,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,1,9]],"date-time":"2010-01-09T00:00:00Z","timestamp":1262995200000},"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":[[2010,1,9]]},"DOI":"10.1145\/1693453.1693457","type":"proceedings-article","created":{"date-parts":[[2010,1,12]],"date-time":"2010-01-12T15:23:12Z","timestamp":1263309792000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Structure-driven optimizations for amorphous data-parallel programs"],"prefix":"10.1145","author":[{"given":"Mario","family":"M\u00e9ndez-Lojo","sequence":"first","affiliation":[{"name":"University of Texas, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald","family":"Nguyen","sequence":"additional","affiliation":[{"name":"University of Texas, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Prountzos","sequence":"additional","affiliation":[{"name":"University of Texas, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Sui","sequence":"additional","affiliation":[{"name":"University of Texas, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Amber","family":"Hassaan","sequence":"additional","affiliation":[{"name":"University of Texas, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milind","family":"Kulkarni","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Burtscher","sequence":"additional","affiliation":[{"name":"University of Texas, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keshav","family":"Pingali","sequence":"additional","affiliation":[{"name":"University of Texas, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137900"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v27:2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375619"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375527.1375560"},{"key":"e_1_3_2_1_5_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas","year":"2001","unstructured":"Thomas Cormen , Charles Leiserson , Ronald Rivest , and Clifford Stein , editors. Introduction to Algorithms . MIT Press , 2001 . Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein, editors. Introduction to Algorithms. MIT Press, 2001."},{"key":"e_1_3_2_1_6_1","first-page":"425","volume-title":"Handbook of Computational Geometry","author":"Eppstein David","year":"1999","unstructured":"David Eppstein . Spanning trees and spanners . In J. Sack and J. Urrutia, editors, Handbook of Computational Geometry , pages 425 -- 461 . Elsevier , 1999 . David Eppstein. Spanning trees and spanners. In J. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425--461. Elsevier, 1999."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758770"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3916.3988"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273442.1250759"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2009.4919639"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504181"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353534.1346311"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640095"},{"key":"e_1_3_2_1_17_1","volume-title":"Patterns for Parallel Programming","author":"Mattson Timothy","year":"2004","unstructured":"Timothy Mattson , Beverly Sanders , and Berna Massingill . Patterns for Parallel Programming . Addison-Wesley Publishers , 2004 . Timothy Mattson, Beverly Sanders, and Berna Massingill. Patterns for Parallel Programming. Addison-Wesley Publishers, 2004."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111068"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.05.010"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765931.1765947"},{"key":"e_1_3_2_1_21_1","unstructured":"http:\/\/www.openmp.org\/.  http:\/\/www.openmp.org\/."},{"key":"e_1_3_2_1_22_1","unstructured":"D. Patterson K. Keutzer K. Asanovica K. Yelick and R. Bodik. Berkeley dwarfs. http:\/\/view.eecs.berkeley.edu\/.  D. Patterson K. Keutzer K. Asanovica K. Yelick and R. Bodik. Berkeley dwarfs. http:\/\/view.eecs.berkeley.edu\/."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009495"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1123001"},{"key":"e_1_3_2_1_25_1","unstructured":"Marc Snir. http:\/\/wing.cs.uiuc.edu\/group\/patterns\/.  Marc Snir. http:\/\/wing.cs.uiuc.edu\/group\/patterns\/."},{"key":"e_1_3_2_1_26_1","first-page":"13","volume-title":"CASCON '99","author":"Vall\u00e9e-Rai Raja","year":"1999","unstructured":"Raja Vall\u00e9e-Rai , Phong Co , Etienne Gagnon , Laurie Hendren , Patrick Lam , and Vijay Sundaresan . Soot - a java bytecode optimization framework . In CASCON '99 , page 13 , 1999 . Raja Vall\u00e9e-Rai, Phong Co, Etienne Gagnon, Laurie Hendren, Patrick Lam, and Vijay Sundaresan. Soot - a java bytecode optimization framework. In CASCON '99, page 13, 1999."}],"event":{"name":"PPoPP '10: ACM SIGPLAN Principles and Practice of Parallel Computing","location":"Bangalore India","acronym":"PPoPP '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1693453.1693457","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1693453.1693457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:45:34Z","timestamp":1750236334000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1693453.1693457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,9]]},"references-count":26,"alternative-id":["10.1145\/1693453.1693457","10.1145\/1693453"],"URL":"https:\/\/doi.org\/10.1145\/1693453.1693457","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1837853.1693457","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,1,9]]},"assertion":[{"value":"2010-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}