{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T01:48:38Z","timestamp":1761788918768,"version":"3.41.0"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T00:00:00Z","timestamp":1268352000000},"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":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2010,3,12]]},"abstract":"<jats:p>Current data intensive scalable computing (DISC) systems, although scalable, achieve embarrassingly low rates of processing per node. We feel that current DISC systems have repeated a mistake of old high-performance systems: focusing on scalability without considering efficiency. This poor efficiency comes with issues in reliability, energy, and cost. As the gap between theoretical performance and what is actually achieved has become glaringly large, we feel there is a pressing need to rethink the design of future data intensive computing and carefully consider the direction of future research.<\/jats:p>","DOI":"10.1145\/1740390.1740400","type":"journal-article","created":{"date-parts":[[2010,3,19]],"date-time":"2010-03-19T19:22:47Z","timestamp":1269026567000},"page":"40-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Efficiency matters!"],"prefix":"10.1145","volume":"44","author":[{"given":"Eric","family":"Anderson","sequence":"first","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}]},{"given":"Joseph","family":"Tucek","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}]}],"member":"320","published-online":{"date-parts":[[2010,3,12]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"857","volume-title":"PPSC 1995: SIAM Conference on Parallel Processing for Scientific Computing","author":"Alpern Bowen","year":"1995"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1496909.1496923"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/13900.18159"},{"issue":"8","key":"e_1_2_1_4_1","first-page":"54","article-title":"Highly parallel perspective: Twelve ways to fool the masses when giving performance results on parallel computers","volume":"4","author":"Bailey David H.","year":"1991","journal-title":"Supercomputing Review"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Luiz Andr\u00e9 Barroso. Saving the planet with systems research. Keynote abstract at http:\/\/www.cs.virginia.edu\/asplos09\/keynote.htm Accessed June 2009. Luiz Andr\u00e9 Barroso. Saving the planet with systems research. Keynote abstract at http:\/\/www.cs.virginia.edu\/asplos09\/keynote.htm Accessed June 2009.","DOI":"10.1145\/1508244.2433037"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2007.443"},{"key":"e_1_2_1_8_1","unstructured":"Grzegorz Czajkowski. Sorting 1pb with MapReduce. Available at http:\/\/googleblog.blogspot.com\/2008\/11\/sorting-1pb-with-mapreduce.html Accessed June 2009. Grzegorz Czajkowski. Sorting 1pb with MapReduce. Available at http:\/\/googleblog.blogspot.com\/2008\/11\/sorting-1pb-with-mapreduce.html Accessed June 2009."},{"volume-title":"OSDI '04: Proceedings of the Sixth Conference on Operating Systems Design and Implementation. USENIX Association","year":"2004","author":"Dean Jeffrey","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250665"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_1_12_1","unstructured":"James Hamilton. Service design best practices. Available at http:\/\/www.mvdirona.com\/jrh\/TalksAndPapers\/JamesHamilton_POA20090226.pdf Accessed September 2009. James Hamilton. Service design best practices. Available at http:\/\/www.mvdirona.com\/jrh\/TalksAndPapers\/JamesHamilton_POA20090226.pdf Accessed September 2009."},{"volume-title":"HotOS 2009, 2009","year":"2009","author":"He Bingsheng","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","unstructured":"Joseph M. Hellerstein. Diverging views on Big Data density and some gimmes. Available at http:\/\/databeta.wordpress.com\/2009\/05\/14\/bigdata-node-density\/ Accessed June 2009. Joseph M. Hellerstein. Diverging views on Big Data density and some gimmes. Available at http:\/\/databeta.wordpress.com\/2009\/05\/14\/bigdata-node-density\/ Accessed June 2009."},{"key":"e_1_2_1_15_1","unstructured":"Energy-efficient software guidelines. Available at http:\/\/software.intel.com\/en-us\/articles\/energy-efficient-software-guidelines\/ Accessed June 2009. Energy-efficient software guidelines. Available at http:\/\/software.intel.com\/en-us\/articles\/energy-efficient-software-guidelines\/ Accessed June 2009."},{"key":"e_1_2_1_16_1","unstructured":"Guillaume Marceau. The speed size and dependability of programming languages. Available at http:\/\/gmarceau.qc.ca\/blog\/2009\/05\/speed-size-and-dependability-of.html Accessed June 2009. Guillaume Marceau. The speed size and dependability of programming languages. Available at http:\/\/gmarceau.qc.ca\/blog\/2009\/05\/speed-size-and-dependability-of.html Accessed June 2009."},{"key":"e_1_2_1_17_1","unstructured":"Chris Nyberg and Mehul Shah. Sort benchmark home page. Available at http:\/\/sortbenchmark.org Accessed June 2009. Chris Nyberg and Mehul Shah. Sort benchmark home page. Available at http:\/\/sortbenchmark.org Accessed June 2009."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559865"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1155\/2005\/962135"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.876288"},{"key":"e_1_2_1_21_1","unstructured":"Benchmarking - thrift-protobuf-compare. Available at http:\/\/code.google.com\/p\/thrift-protobuf-compare\/wiki\/Benchmarking Accessed June 2009. Benchmarking - thrift-protobuf-compare. Available at http:\/\/code.google.com\/p\/thrift-protobuf-compare\/wiki\/Benchmarking Accessed June 2009."}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1740390.1740400","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1740390.1740400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:40:55Z","timestamp":1750250455000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1740390.1740400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,12]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3,12]]}},"alternative-id":["10.1145\/1740390.1740400"],"URL":"https:\/\/doi.org\/10.1145\/1740390.1740400","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2010,3,12]]},"assertion":[{"value":"2010-03-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}