{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:51Z","timestamp":1772164071742,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,10,15]],"date-time":"2014-10-15T00:00:00Z","timestamp":1413331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61133006"],"award-info":[{"award-number":["61133006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2012AA010901"],"award-info":[{"award-number":["2012AA010901"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,10,15]]},"DOI":"10.1145\/2660193.2660204","type":"proceedings-article","created":{"date-parts":[[2014,10,21]],"date-time":"2014-10-21T08:59:05Z","timestamp":1413881945000},"page":"895-908","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Cybertron"],"prefix":"10.1145","author":[{"given":"Tian","family":"Xiao","sequence":"first","affiliation":[{"name":"Tsinghua University & Microsoft Research, Beijing, China"}]},{"given":"Zhenyu","family":"Guo","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China"}]},{"given":"Hucheng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China"}]},{"given":"Jiaxing","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China"}]},{"given":"Xu","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, Canada"}]},{"given":"Chencheng","family":"Ye","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}]},{"given":"Xi","family":"Wang","sequence":"additional","affiliation":[{"name":"Massachusettes Institute of Technology, Cambridge, MA, USA"}]},{"given":"Wei","family":"Lin","sequence":"additional","affiliation":[{"name":"Microsoft Bing, Bellevue, WA, USA"}]},{"given":"Wenguang","family":"Chen","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Lidong","family":"Zhou","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2014,10,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142548"},{"key":"e_1_3_2_1_2_1","unstructured":"Apache. Hadoop. http:\/\/lucene.apache.org\/hadoop\/.  Apache. Hadoop. http:\/\/lucene.apache.org\/hadoop\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.41"},{"key":"e_1_3_2_1_4_1","first-page":"209","volume-title":"OSDI","author":"Cadar C.","year":"2008","unstructured":"C. Cadar , D. Dunbar , and D. R. Engler . KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs . In OSDI , pages 209 -- 224 , 2008 . C. Cadar, D. Dunbar, and D. R. Engler. KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs. In OSDI, pages 209--224, 2008."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346281.1346322"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806638"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096090"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294274"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_11_1","first-page":"137","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified data processing on large clusters . In OSDI , pages 137 -- 150 , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI, pages 137--150, 2004."},{"key":"e_1_3_2_1_12_1","unstructured":"P. Deutsch. DEFLATE compressed data format specification version 1.3. http:\/\/www.ietf.org\/rfc\/rfc1951.txt.   P. Deutsch. DEFLATE compressed data format specification version 1.3. http:\/\/www.ietf.org\/rfc\/rfc1951.txt."},{"key":"e_1_3_2_1_13_1","first-page":"343","volume-title":"NSDI","author":"Gkantsidis C.","year":"2013","unstructured":"C. Gkantsidis , D. Vytiniotis , O. Hodson , D. Narayanan , F. Dinu , and A. Rowstron . Rhea: automatic filtering for unstructured cloud storage . In NSDI , pages 343 -- 356 , 2013 . C. Gkantsidis, D. Vytiniotis, O. Hodson, D. Narayanan, F. Dinu, and A. Rowstron. Rhea: automatic filtering for unstructured cloud storage. In NSDI, pages 343--356, 2013."},{"key":"e_1_3_2_1_14_1","first-page":"121","volume-title":"OSDI","author":"Guo Z.","year":"2012","unstructured":"Z. Guo , X. Fan , R. Chen , J. Zhang , H. Zhou , S. McDirmid , C. Liu , W. Lin , J. Zhou , and L. Zhou . Spotting code optimizations in data-parallel pipelines through PeriSCOPE . In OSDI , pages 121 -- 133 , 2012 . Z. Guo, X. Fan, R. Chen, J. Zhang, H. Zhou, S. McDirmid, C. Liu, W. Lin, J. Zhou, and L. Zhou. Spotting code optimizations in data-parallel pipelines through PeriSCOPE. In OSDI, pages 121--133, 2012."},{"key":"e_1_3_2_1_15_1","unstructured":"ILSpy. The open-source .NET assembly browser and decompiler. http:\/\/ilspy.net\/.  ILSpy. The open-source .NET assembly browser and decompiler. http:\/\/ilspy.net\/."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1978665.1978670"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920886"},{"key":"e_1_3_2_1_20_1","unstructured":"Microsoft. PEX. http:\/\/research.microsoft.com\/en-us\/projects\/pex\/.  Microsoft. PEX. http:\/\/research.microsoft.com\/en-us\/projects\/pex\/."},{"key":"e_1_3_2_1_21_1","first-page":"267","volume-title":"USENIX ATC","author":"Olston C.","year":"2008","unstructured":"C. Olston , B. Reed , A. Silberstein , and U. Srivastava . Automatic optimization of parallel dataflow programs . In USENIX ATC , pages 267 -- 273 , 2008 . C. Olston, B. Reed, A. Silberstein, and U. Srivastava. Automatic optimization of parallel dataflow programs. In USENIX ATC, pages 267--273, 2008."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_3_2_1_23_1","volume-title":"http:\/\/www.7-zip.org\/","author":"Pavlov I.","year":"2013","unstructured":"I. Pavlov . 7-Zip. http:\/\/www.7-zip.org\/ , 2013 . I. Pavlov. 7-Zip. http:\/\/www.7-zip.org\/, 2013."},{"key":"e_1_3_2_1_24_1","first-page":"553","volume-title":"VLDB","author":"Stonebraker M.","year":"2005","unstructured":"M. Stonebraker , D. J. Abadi , A. Batkin , X. Chen , M. Cherniack , M. Ferreira , E. Lau , A. Lin , S. Madden , E. O'Neil , P. O'Neil , A. Rasin , N. Tran , and S. Zdonik . C-Store: a column-oriented DBMS . In VLDB , pages 553 -- 564 , 2005 . M. Stonebraker, D. J. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau, A. Lin, S. Madden, E. O'Neil, P. O'Neil, A. Rasin, N. Tran, and S. Zdonik. C-Store: a column-oriented DBMS. In VLDB, pages 553--564, 2005."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687609"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294275"},{"key":"e_1_3_2_1_27_1","first-page":"1","volume-title":"OSDI","author":"Yu Y.","year":"2008","unstructured":"Y. Yu , M. Isard , D. Fetterly , M. Budiu , \u00da. Erlingsson, P. K. Gunda , and J. Currey . DryadLINQ: A system for general-purpose distributed data-parallel computing using a high-level language . In OSDI , pages 1 -- 14 , 2008 . Y. Yu, M. Isard, D. Fetterly, M. Budiu, \u00da. Erlingsson, P. K. Gunda, and J. Currey. DryadLINQ: A system for general-purpose distributed data-parallel computing using a high-level language. In OSDI, pages 1--14, 2008."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629600"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1736020.1736038"},{"key":"e_1_3_2_1_30_1","first-page":"295","volume-title":"NSDI","author":"Zhang J.","year":"2012","unstructured":"J. Zhang , H. Zhou , R. Chen , X. Fan , Z. Guo , H. Lin , J. Y. Li , W. Lin , J. Zhou , and L. Zhou . Optimizing data shuffling in data-parallel computation by understanding user-defined functions . In NSDI , pages 295 -- 308 , 2012 . J. Zhang, H. Zhou, R. Chen, X. Fan, Z. Guo, H. Lin, J. Y. Li, W. Lin, J. Zhou, and L. Zhou. Optimizing data shuffling in data-parallel computation by understanding user-defined functions. In NSDI, pages 295--308, 2012."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447802"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0280-z"}],"event":{"name":"SPLASH '14: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Portland Oregon USA","acronym":"SPLASH '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGAda ACM Special Interest Group on Ada Programming Language"]},"container-title":["Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660193.2660204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660193.2660204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:14:42Z","timestamp":1750263282000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660193.2660204"}},"subtitle":["pushing the limit on I\/O reduction in data-parallel programs"],"short-title":[],"issued":{"date-parts":[[2014,10,15]]},"references-count":32,"alternative-id":["10.1145\/2660193.2660204","10.1145\/2660193"],"URL":"https:\/\/doi.org\/10.1145\/2660193.2660204","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2714064.2660204","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,10,15]]},"assertion":[{"value":"2014-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}