{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T13:34:15Z","timestamp":1775309655499,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,4,13]],"date-time":"2010-04-13T00:00:00Z","timestamp":1271116800000},"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":[[2010,4,13]]},"DOI":"10.1145\/1755913.1755940","type":"proceedings-article","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T12:45:48Z","timestamp":1272372348000},"page":"265-278","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":958,"title":["Delay scheduling"],"prefix":"10.1145","author":[{"given":"Matei","family":"Zaharia","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]},{"given":"Dhruba","family":"Borthakur","sequence":"additional","affiliation":[{"name":"Facebook Inc, Palo Alto, CA, USA"}]},{"given":"Joydeep","family":"Sen Sarma","sequence":"additional","affiliation":[{"name":"Facebook Inc, Palo Alto, CA, USA"}]},{"given":"Khaled","family":"Elmeleegy","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Sunnyvale, CA, USA"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]},{"given":"Ion","family":"Stoica","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,4,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Amazon EC2. http:\/\/aws.amazon.com\/ec2\/.  Amazon EC2. http:\/\/aws.amazon.com\/ec2\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Apache Hadoop. http:\/\/hadoop.apache.org.  Apache Hadoop. http:\/\/hadoop.apache.org."},{"key":"e_1_3_2_1_3_1","unstructured":"Apache Hive. http:\/\/hadoop.apache.org\/hive\/.  Apache Hive. http:\/\/hadoop.apache.org\/hive\/."},{"key":"e_1_3_2_1_4_1","unstructured":"Hadoop Map\/Reduce tutorial. http:\/\/hadoop.apache.org\/common\/docs\/current\/mapred_tutorial.html.  Hadoop Map\/Reduce tutorial. http:\/\/hadoop.apache.org\/common\/docs\/current\/mapred_tutorial.html."},{"key":"e_1_3_2_1_5_1","unstructured":"Hive performance benchmarks. http:\/\/issues.apache.org\/jira\/browse\/HIVE-396.  Hive performance benchmarks. http:\/\/issues.apache.org\/jira\/browse\/HIVE-396."},{"key":"e_1_3_2_1_6_1","unstructured":"HP Neoview Workload Management Services Guide. \\smallurlhttp:\/\/www.docs.hp.com\/en\/544806-001\/Neoview_WMS_Guide_R2.3.pdf.  HP Neoview Workload Management Services Guide. \\smallurlhttp:\/\/www.docs.hp.com\/en\/544806-001\/Neoview_WMS_Guide_R2.3.pdf."},{"key":"e_1_3_2_1_7_1","unstructured":"Max-Min Fairness (Wikipedia). http:\/\/en.wikipedia.org\/wiki\/Max-min_fairness.  Max-Min Fairness (Wikipedia). http:\/\/en.wikipedia.org\/wiki\/Max-min_fairness."},{"key":"e_1_3_2_1_8_1","unstructured":"NSF Cluster Exploratory (CluE) Program Solicitation. http:\/\/www.nsf.gov\/pubs\/2008\/nsf08560\/nsf08560.htm.  NSF Cluster Exploratory (CluE) Program Solicitation. http:\/\/www.nsf.gov\/pubs\/2008\/nsf08560\/nsf08560.htm."},{"key":"e_1_3_2_1_9_1","unstructured":"Official Google Blog: Sorting 1PB with MapReduce. \\smallurlhttp:\/\/googleblog.blogspot.com\/2008\/11\/sorting-1pb-with-mapreduce.%html.  Official Google Blog: Sorting 1PB with MapReduce. \\smallurlhttp:\/\/googleblog.blogspot.com\/2008\/11\/sorting-1pb-with-mapreduce.%html."},{"key":"e_1_3_2_1_10_1","unstructured":"Open Cirrus. http:\/\/opencirrus.org\/.  Open Cirrus. http:\/\/opencirrus.org\/."},{"key":"e_1_3_2_1_11_1","unstructured":"Personal communication with Hans Zeller of HP.  Personal communication with Hans Zeller of HP."},{"key":"e_1_3_2_1_12_1","unstructured":"Personal communication with Owen O'Malley of the Yahoo! Hadoop team.  Personal communication with Owen O'Malley of the Yahoo! Hadoop team."},{"key":"e_1_3_2_1_13_1","unstructured":"TORQUE Resource Manager. http:\/\/www.clusterresources.com\/pages\/products\/torque-resource-manager.php.  TORQUE Resource Manager. http:\/\/www.clusterresources.com\/pages\/products\/torque-resource-manager.php."},{"key":"e_1_3_2_1_14_1","unstructured":"Yahoo! Launches New Program to Advance Open-Source Software for Internet Computing. http:\/\/research.yahoo.com\/node\/1879.  Yahoo! Launches New Program to Advance Open-Source Software for Internet Computing. http:\/\/research.yahoo.com\/node\/1879."},{"key":"e_1_3_2_1_15_1","first-page":"120","volume-title":"IEEE INFOCOM'96","author":"Bennett J.","year":"1996","unstructured":"J. Bennett and H. Zhang . WF2Q): Worst-case fair weighted fair queueing . In IEEE INFOCOM'96 , pages 120 -- 128 , 1996 . J. Bennett and H. Zhang. WF2Q): Worst-case fair weighted fair queueing. In IEEE INFOCOM'96, pages 120--128, 1996."},{"key":"e_1_3_2_1_16_1","volume-title":"NSDI'04","author":"Bent J.","year":"2004","unstructured":"J. Bent , D. Thain , A. C. Arpaci-Dusseau , R. H. Arpaci-Dusseau , and M. Livny . Explicit control in a batch--aware distributed file system . In NSDI'04 , 2004 . J. Bent, D. Thain, A. C. Arpaci-Dusseau, R. H. Arpaci-Dusseau, and M. Livny. Explicit control in a batch--aware distributed file system. In NSDI'04, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/GRID.2007.4354142"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_19_1","first-page":"3","volume-title":"Journal of Internetworking Research and Experience","author":"Demers A.","year":"1990","unstructured":"A. Demers , S. Keshav , and S. Shenker . Analysis and simulation of a fair queueing algorithm . In Journal of Internetworking Research and Experience , pages 3 -- 26 , Oct. 1990 . A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In Journal of Internetworking Research and Experience, pages 3--26, Oct. 1990."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.413212"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_3_2_1_22_1","volume-title":"Workshop on Hot Topics in Cloud Computing (HotCloud) 2009","author":"Hindman B.","year":"2009","unstructured":"B. Hindman , A. Konwinski , M. Zaharia , and I. Stoica . A common substrate for cluster computing . In Workshop on Hot Topics in Cloud Computing (HotCloud) 2009 , 2009 . B. Hindman, A. Konwinski, M. Zaharia, and I. Stoica. A common substrate for cluster computing. In Workshop on Hot Topics in Cloud Computing (HotCloud) 2009, 2009."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629601"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/762483.762484"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559865"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/263105.263175"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.v17:2\/4"},{"key":"e_1_3_2_1_30_1","volume-title":"OSDI 94","author":"Waldspurger C. A.","year":"1994","unstructured":"C. A. Waldspurger and W. E. Weihl . Lottery scheduling: Flexible proportional-share resource management . In OSDI 94 , 1994 . C. A. Waldspurger and W. E. Weihl. Lottery scheduling: Flexible proportional-share resource management. In OSDI 94, 1994."}],"event":{"name":"EuroSys '10: Fifth EuroSys Conference 2010","location":"Paris France","acronym":"EuroSys '10","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 5th European conference on Computer systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1755913.1755940","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1755913.1755940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:34Z","timestamp":1750250734000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1755913.1755940"}},"subtitle":["a simple technique for achieving locality and fairness in cluster scheduling"],"short-title":[],"issued":{"date-parts":[[2010,4,13]]},"references-count":29,"alternative-id":["10.1145\/1755913.1755940","10.1145\/1755913"],"URL":"https:\/\/doi.org\/10.1145\/1755913.1755940","relation":{},"subject":[],"published":{"date-parts":[[2010,4,13]]},"assertion":[{"value":"2010-04-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}