{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T07:14:12Z","timestamp":1767165252434,"version":"build-2238731810"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T00:00:00Z","timestamp":1307404800000},"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,7]]},"DOI":"10.1145\/1993744.1993788","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T10:36:21Z","timestamp":1307529381000},"page":"125-126","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Applying idealized lower-bound runtime models to understand inefficiencies in data-intensive computing"],"prefix":"10.1145","author":[{"given":"Elie","family":"Krevat","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomer","family":"Shiran","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Anderson","sequence":"additional","affiliation":[{"name":"HP Labs, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Tucek","sequence":"additional","affiliation":[{"name":"HP Labs, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jay J.","family":"Wylie","sequence":"additional","affiliation":[{"name":"HP Labs, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory R.","family":"Ganger","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Apache Hadoop. http:\/\/hadoop.apache.org\/.  Apache Hadoop. http:\/\/hadoop.apache.org\/."},{"key":"e_1_3_2_1_2_1","volume-title":"OSDI","author":"Ananthanarayanan G.","year":"2010","unstructured":"G. Ananthanarayanan , Reining in the Outliers in Map-Reduce Clusters using Mantri . OSDI , 2010 . G. Ananthanarayanan, et al. Reining in the Outliers in Map-Reduce Clusters using Mantri. OSDI, 2010."},{"key":"e_1_3_2_1_3_1","volume-title":"Data-Intensive Supercomputing: The Case for DISC. Technical report","author":"Bryant R. E.","year":"2007","unstructured":"R. E. Bryant . Data-Intensive Supercomputing: The Case for DISC. Technical report . 2007 . Carnegie Mellon University-CS- 07-128. R. E. Bryant. Data-Intensive Supercomputing: The Case for DISC. Technical report. 2007. Carnegie Mellon University-CS-07-128."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_5_1","volume-title":"Applying Simple Performance Models to Understand Inefficiencies in Data-Intensive Computing. Technical report","author":"Krevat E.","year":"2011","unstructured":"E. Krevat , Applying Simple Performance Models to Understand Inefficiencies in Data-Intensive Computing. Technical report . 2011 . Carnegie Mellon University-PDL- 11-103. E. Krevat, et al. Applying Simple Performance Models to Understand Inefficiencies in Data-Intensive Computing. Technical report. 2011. Carnegie Mellon University-PDL-11-103."},{"key":"e_1_3_2_1_6_1","volume-title":"HotOS","author":"Krevat E.","year":"2011","unstructured":"E. Krevat , Disks Are Like Snowflakes: No Two Are Alike . HotOS , 2011 . E. Krevat, et al. Disks Are Like Snowflakes: No Two Are Alike. HotOS, 2011."},{"key":"e_1_3_2_1_7_1","volume-title":"FAST","author":"Phanishayee A.","year":"2008","unstructured":"A. Phanishayee , Measurement and Analysis of TCP Throughput Collapse in Cluster-based Storage Systems . FAST , 2008 . A. Phanishayee, et al. Measurement and Analysis of TCP Throughput Collapse in Cluster-based Storage Systems. FAST, 2008."}],"event":{"name":"SIGMETRICS '11: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","location":"San Jose California USA","acronym":"SIGMETRICS '11","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993744.1993788","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993744.1993788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:05:51Z","timestamp":1750230351000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993744.1993788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,7]]},"references-count":7,"aliases":["10.1145\/2007116.2007155"],"alternative-id":["10.1145\/1993744.1993788","10.1145\/1993744"],"URL":"https:\/\/doi.org\/10.1145\/1993744.1993788","relation":{},"subject":[],"published":{"date-parts":[[2011,6,7]]},"assertion":[{"value":"2011-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}