{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:18:15Z","timestamp":1763468295513,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T00:00:00Z","timestamp":1456704000000},"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":[[2016,2,29]]},"DOI":"10.1145\/2854038.2854042","type":"proceedings-article","created":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T15:33:04Z","timestamp":1456846384000},"page":"194-205","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Have abstraction and eat performance, too: optimized heterogeneous computing with parallel patterns"],"prefix":"10.1145","author":[{"given":"Kevin J.","family":"Brown","sequence":"first","affiliation":[{"name":"Stanford University, USA"}]},{"given":"HyoukJoong","family":"Lee","sequence":"additional","affiliation":[{"name":"Stanford University, USA \/ Google, USA"}]},{"given":"Tiark","family":"Rompf","sequence":"additional","affiliation":[{"name":"Purdue University, USA"}]},{"given":"Arvind K.","family":"Sujeeth","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}]},{"given":"Christopher","family":"De Sa","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}]},{"given":"Christopher","family":"Aberger","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}]},{"given":"Kunle","family":"Olukotun","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,2,29]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Livejournal social network. http:\/\/snap.stanford.edu\/ data\/soc-LiveJournal1.html.  Livejournal social network. http:\/\/snap.stanford.edu\/ data\/soc-LiveJournal1.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869469"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11970-5_16"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_5_1","volume-title":"A practical automatic polyhedral program optimization system","author":"Bondhugula U.","year":"2008","unstructured":"U. Bondhugula , A. Hartono , J. Ramanujam , and P. Sadayappan . A practical automatic polyhedral program optimization system . 2008 . U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan. A practical automatic polyhedral program optimization system. 2008."},{"key":"e_1_3_2_1_6_1","first-page":"123","article-title":"Program transformation with scoped dynamic rewrite rules","volume":"69","author":"Bravenboer M.","year":"2005","unstructured":"M. Bravenboer , A. van Dam , K. Olmos , and E. Visser . Program transformation with scoped dynamic rewrite rules . Fundam. Inf. , 69 : 123 \u2013 178 , July 2005 . ISSN 0169-2968. M. Bravenboer, A. van Dam, K. Olmos, and E. Visser. Program transformation with scoped dynamic rewrite rules. Fundam. Inf., 69:123\u2013178, July 2005. ISSN 0169-2968.","journal-title":"Fundam. Inf."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.15"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806638"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103845.1094852"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/201059.201061"},{"key":"e_1_3_2_1_11_1","first-page":"150","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified Data Processing on Large Clusters. In OSDI , OSDI , pages 137\u2013 150 , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI, OSDI, pages 137\u2013 150, 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254066"},{"key":"e_1_3_2_1_13_1","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . Powergraph: Distributed graph-parallel computation on natural graphs . In OSDI , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In OSDI, 2012."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626412500107"},{"key":"e_1_3_2_1_15_1","volume-title":"Thrust: C++ template library for CUDA","author":"Hoberock J.","year":"2009","unstructured":"J. Hoberock and N. Bell . Thrust: C++ template library for CUDA , 2009 . J. Hoberock and N. Bell. Thrust: C++ template library for CUDA, 2009."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2581122.2544162"},{"key":"e_1_3_2_1_17_1","volume-title":"Spartan: A distributed array framework with smart tiling","author":"Huang C.-C.","year":"2015","unstructured":"C.-C. Huang , Q. Chen , Z. Wang , R. Power , J. Ortiz , J. Li , and Z. Xiao . Spartan: A distributed array framework with smart tiling . USENIX Association , 2015 . C.-C. Huang, Q. Chen, Z. Wang, R. Power, J. Ortiz, J. Li, and Z. Xiao. Spartan: A distributed array framework with smart tiling. USENIX Association, 2015."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559962"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_1_20_1","first-page":"414","volume-title":"FSTTCS","author":"Jones S. L. P.","year":"2008","unstructured":"S. L. P. Jones , R. Leshchinskiy , G. Keller , and M. M. T. Chakravarty . Harnessing the multicores: Nested data parallelism in Haskell . In FSTTCS , pages 383\u2013 414 , 2008 . S. L. P. Jones, R. Leshchinskiy, G. Keller, and M. M. T. Chakravarty. Harnessing the multicores: Nested data parallelism in Haskell. In FSTTCS, pages 383\u2013414, 2008."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2014.23"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/565816.503298"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646665.699105"},{"key":"e_1_3_2_1_25_1","unstructured":"F. McSherry M. Isard and D. G. Murray. Scalability! but at what cost?  F. McSherry M. Isard and D. G. Murray. Scalability! but at what cost?"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_27_1","first-page":"693","article-title":"Hogwild!: A lockfree approach to parallelizing stochastic gradient descent","volume":"24","author":"Niu F.","year":"2011","unstructured":"F. Niu , B. Recht , C. R\u00e9 , and S. J. Wright . Hogwild!: A lockfree approach to parallelizing stochastic gradient descent . Advances in Neural Information Processing Systems , 24 : 693 \u2013 701 , 2011 . F. Niu, B. Recht, C. R\u00e9, and S. J. Wright. Hogwild!: A lockfree approach to parallelizing stochastic gradient descent. Advances in Neural Information Processing Systems, 24:693\u2013 701, 2011.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_28_1","first-page":"25","article-title":"Deepdive: Webscale knowledge-base construction using statistical learning and inference","volume":"12","author":"Niu F.","year":"2012","unstructured":"F. Niu , C. Zhang , C. R\u00e9 , and J. W. Shavlik . Deepdive: Webscale knowledge-base construction using statistical learning and inference . VLDS , 12 : 25 \u2013 28 , 2012 . F. Niu, C. Zhang, C. R\u00e9, and J. W. Shavlik. Deepdive: Webscale knowledge-base construction using statistical learning and inference. VLDS, 12:25\u201328, 2012.","journal-title":"VLDS"},{"key":"e_1_3_2_1_29_1","volume-title":"Euro-Par","author":"Prokopec A.","year":"2010","unstructured":"A. Prokopec , P. Bagwell , and T. R. abd Martin Odersky. A generic parallel collection framework . Euro-Par , 2010 . A. Prokopec, P. Bagwell, and T. R. abd Martin Odersky. A generic parallel collection framework. Euro-Par, 2010."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429128"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522715"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39038-8_3"},{"key":"e_1_3_2_1_33_1","volume-title":"Combining optimizations, combining theories. Technical report","author":"Veldhuizen T. L.","year":"2008","unstructured":"T. L. Veldhuizen and J. G. Siek . Combining optimizations, combining theories. Technical report , Indiana University , 2008 . T. L. Veldhuizen and J. G. Siek. Combining optimizations, combining theories. Technical report, Indiana University, 2008."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2400682.2400713"},{"key":"e_1_3_2_1_35_1","volume-title":"NSDI","author":"Zaharia M.","year":"2011","unstructured":"M. Zaharia , M. Chowdhury , T. Das , A. Dave , J. Ma , M. Mc-Cauley , M. Franklin , S. Shenker , and I. Stoica . Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing . NSDI , 2011 . M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. Mc-Cauley, M. Franklin, S. Shenker, and I. Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. NSDI, 2011."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2733001"}],"event":{"name":"CGO '16: 14th Annual IEEE\/ACM International Symposium on Code Generation and Optimization","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing","IEEE-CS Computer Society"],"location":"Barcelona Spain","acronym":"CGO '16"},"container-title":["Proceedings of the 2016 International Symposium on Code Generation and Optimization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854038.2854042","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2854038.2854042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:30Z","timestamp":1750273470000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854038.2854042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,29]]},"references-count":36,"alternative-id":["10.1145\/2854038.2854042","10.1145\/2854038"],"URL":"https:\/\/doi.org\/10.1145\/2854038.2854042","relation":{},"subject":[],"published":{"date-parts":[[2016,2,29]]},"assertion":[{"value":"2016-02-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}