{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T09:23:06Z","timestamp":1773134586326,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"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,6,4]]},"DOI":"10.1145\/1993498.1993501","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T07:53:52Z","timestamp":1307346832000},"page":"12-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":220,"title":["The tao of parallelism in algorithms"],"prefix":"10.1145","author":[{"given":"Keshav","family":"Pingali","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Donald","family":"Nguyen","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Milind","family":"Kulkarni","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"given":"Martin","family":"Burtscher","sequence":"additional","affiliation":[{"name":"Texas State University--San Marcos, San Marcos, TX, USA"}]},{"given":"M. Amber","family":"Hassaan","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Rashid","family":"Kaleem","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Tsung-Hsien","family":"Lee","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Andrew","family":"Lenharth","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Roman","family":"Manevich","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Mario","family":"M\u00e9ndez-Lojo","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Dimitrios","family":"Prountzos","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Xin","family":"Sui","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Compilers: principles, techniques, and tools","author":"Aho A.","year":"1986","unstructured":"A. Aho , R. Sethi , and J. Ullman . Compilers: principles, techniques, and tools . Addison Wesley , 1986 . A. Aho, R. Sethi, and J. Ullman. Compilers: principles, techniques, and tools. Addison Wesley, 1986."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1769331.1769344"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.48862"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.06.001"},{"key":"e_1_3_2_1_6_1","volume-title":"December","author":"Barnes J.","year":"1986","unstructured":"J. Barnes and P. Hut . A hierarchical o(n log n) force-calculation algorithm. Nature, 324(4) , December 1986 . J. Barnes and P. Hut. A hierarchical o(n log n) force-calculation algorithm. Nature, 324(4), December 1986."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137900"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/209937.209958"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1062400"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/160985.161150"},{"key":"e_1_3_2_1_12_1","volume-title":"Introduction to Algorithms","author":"Cormen T.","year":"2001","unstructured":"T. Cormen , C. Leiserson , R. Rivest , and C. Stein , editors . Introduction to Algorithms . MIT Press , 2001 . T. Cormen, C. Leiserson, R. Rivest, and C. Stein, editors. Introduction to Algorithms. MIT Press, 2001."},{"key":"e_1_3_2_1_13_1","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . Mapreduce: Simplified data processing on large clusters . In OSDI , 2004 . J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, 2004."},{"key":"e_1_3_2_1_14_1","volume-title":"Otdelenie Matematicheskikh i Estestvennykh Nauk,, 7:793--800","author":"Delaunay B.","year":"1934","unstructured":"B. Delaunay . Sur la sphere vide. Izvestia Akademii Nauk SSSR , Otdelenie Matematicheskikh i Estestvennykh Nauk,, 7:793--800 , 1934 . B. Delaunay. Sur la sphere vide. Izvestia Akademii Nauk SSSR, Otdelenie Matematicheskikh i Estestvennykh Nauk,, 7:793--800, 1934."},{"key":"e_1_3_2_1_15_1","volume-title":"CompCon","author":"Dennis J.","year":"1984","unstructured":"J. Dennis . Dataflow ideas for supercomputers . In CompCon , 1984 . J. Dennis. Dataflow ideas for supercomputers. In CompCon, 1984."},{"key":"e_1_3_2_1_16_1","volume-title":"A Discipline of Programming","author":"Dijkstra E.","year":"1976","unstructured":"E. Dijkstra . A Discipline of Programming . Prentice Hall , 1976 . E. Dijkstra. A Discipline of Programming. Prentice Hall, 1976."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/267959.269969"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90066-3"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237724"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0913067"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168877"},{"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.1007\/BF01758770"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250767"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/949305.949340"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941557"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.80123"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345237"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/73141.74821"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248435"},{"key":"e_1_3_2_1_32_1","volume-title":"An Introduction to Parallel Algorithms","author":"JaJa J.","year":"1992","unstructured":"J. JaJa . An Introduction to Parallel Algorithms . Addison-Wesley , 1992 . J. JaJa. An Introduction to Parallel Algorithms. Addison-Wesley, 1992."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3916.3988"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_1_35_1","volume-title":"Morgan Kaufmann","author":"Kennedy K.","year":"2001","unstructured":"K. Kennedy and J. Allen , editors. Optimizing compilers for modern architectures . Morgan Kaufmann , 2001 . K. Kennedy and J. Allen, editors. Optimizing compilers for modern architectures. Morgan Kaufmann, 2001."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1953611.1953615"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.298205"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504181"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993562"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250759"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/143369.143415"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/647671.731305"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_44_1","volume-title":"Information Theory, Inference and Learning Algorithms","author":"Mackay D.","year":"2003","unstructured":"D. Mackay . Information Theory, Inference and Learning Algorithms . Cambridge University Press , 2003 . D. Mackay. Information Theory, Inference and Learning Algorithms. Cambridge University Press, 2003."},{"key":"e_1_3_2_1_45_1","volume-title":"Patterns for Parallel Programming","author":"Mattson T.","year":"2004","unstructured":"T. Mattson , B. Sanders , and B. Massingill . Patterns for Parallel Programming . Addison-Wesley Publishers , 2004 . T. Mattson, B. Sanders, and B. Massingill. Patterns for Parallel Programming. Addison-Wesley Publishers, 2004."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869495"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693457"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/945885.945888"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/6462.6485"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950404"},{"key":"e_1_3_2_1_51_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_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258791"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318.3480"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926405"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.752782"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/645610.661726"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9575-1","volume-title":"Programming with sets: An introduction to SETL","author":"Schwartz J. T.","year":"1986","unstructured":"J. T. Schwartz , R. B. K. Dewar , E. Dubinsky , and E. Schonberg . Programming with sets: An introduction to SETL . Springer-Verlag , 1986 . J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with sets: An introduction to SETL. Springer-Verlag, 1986."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1077"},{"key":"e_1_3_2_1_59_1","volume-title":"Introduction to Data Mining","author":"Tan P.-N.","year":"2005","unstructured":"P.-N. Tan , M. Steinbach , and V. Kumar , editors . Introduction to Data Mining . Pearson Addison Wesley , 2005 . P.-N. Tan, M. Steinbach, and V. Kumar, editors. Introduction to Data Mining. Pearson Addison Wesley, 2005."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.970565"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277680"},{"key":"e_1_3_2_1_63_1","unstructured":"N. Wirth. Algorithms + Data Structures = Programs. Prentice-Hall 1976.   N. Wirth. Algorithms + Data Structures = Programs. Prentice-Hall 1976."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.391186"}],"event":{"name":"PLDI '11: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"San Jose California USA","acronym":"PLDI '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993498.1993501","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993498.1993501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:05:46Z","timestamp":1750230346000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993498.1993501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":62,"alternative-id":["10.1145\/1993498.1993501","10.1145\/1993498"],"URL":"https:\/\/doi.org\/10.1145\/1993498.1993501","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1993316.1993501","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}