{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:45:44Z","timestamp":1773153944615,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,17]],"date-time":"2015-08-17T00:00:00Z","timestamp":1439769600000},"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":[[2015,8,17]]},"DOI":"10.1145\/2785956.2787488","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T10:09:20Z","timestamp":1440410960000},"page":"407-420","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":104,"title":["Network-Aware Scheduling for Data-Parallel Jobs"],"prefix":"10.1145","author":[{"given":"Virajith","family":"Jalaparti","sequence":"first","affiliation":[{"name":"University of Illinois, Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Peter","family":"Bodik","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Ishai","family":"Menache","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Sriram","family":"Rao","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"given":"Konstantin","family":"Makarychev","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Matthew","family":"Caesar","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana-Champaign, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,8,17]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Amazon S3. https:\/\/aws.amazon.com\/s3\/.  Amazon S3. https:\/\/aws.amazon.com\/s3\/."},{"key":"e_1_3_2_2_2_1","unstructured":"Amazon Web Services. http:\/\/aws.amazon.com\/.  Amazon Web Services. http:\/\/aws.amazon.com\/."},{"key":"e_1_3_2_2_3_1","unstructured":"Apache Hadoop. http:\/\/hadoop.apache.org\/.  Apache Hadoop. http:\/\/hadoop.apache.org\/."},{"key":"e_1_3_2_2_4_1","unstructured":"Apache Tez. http:\/\/hortonworks.com\/hadoop\/tez\/.  Apache Tez. http:\/\/hortonworks.com\/hadoop\/tez\/."},{"key":"e_1_3_2_2_5_1","unstructured":"Facebook data grows by over 500 TB daily. http:\/\/tinyurl.com\/96d8oqj\/.  Facebook data grows by over 500 TB daily. http:\/\/tinyurl.com\/96d8oqj\/."},{"key":"e_1_3_2_2_6_1","unstructured":"Hadoop Distributed Filesystem. http:\/\/hadoop.apache.org\/hdfs.  Hadoop Distributed Filesystem. http:\/\/hadoop.apache.org\/hdfs."},{"key":"e_1_3_2_2_7_1","unstructured":"Hadoop MapReduce Next Generation - Capacity Scheduler. http:\/\/tinyurl.com\/no2evu5.  Hadoop MapReduce Next Generation - Capacity Scheduler. http:\/\/tinyurl.com\/no2evu5."},{"key":"e_1_3_2_2_8_1","unstructured":"Hadoop YARN Project. http:\/\/tinyurl.com\/bnadg9l.  Hadoop YARN Project. http:\/\/tinyurl.com\/bnadg9l."},{"key":"e_1_3_2_2_9_1","unstructured":"Microsoft Azure. https:\/\/azure.microsoft.com\/.  Microsoft Azure. https:\/\/azure.microsoft.com\/."},{"key":"e_1_3_2_2_10_1","unstructured":"Microsoft Azure Storage. https:\/\/azure.microsoft.com\/en-us\/services\/storage\/.  Microsoft Azure Storage. https:\/\/azure.microsoft.com\/en-us\/services\/storage\/."},{"key":"e_1_3_2_2_11_1","unstructured":"ORC File Format. http:\/\/tinyurl.com\/n4pxofh.  ORC File Format. http:\/\/tinyurl.com\/n4pxofh."},{"key":"e_1_3_2_2_12_1","unstructured":"TPC Benchmark H. http:\/\/www.tpc.org\/tpch\/.  TPC Benchmark H. http:\/\/www.tpc.org\/tpch\/."},{"key":"e_1_3_2_2_13_1","unstructured":"Windows Azure's Flat Network Storage and 2012 Scalability Targets. http:\/\/bit.ly\/1A4Hbjt.  Windows Azure's Flat Network Storage and 2012 Scalability Targets. http:\/\/bit.ly\/1A4Hbjt."},{"key":"e_1_3_2_2_14_1","volume-title":"Re-optimizing Data-parallel Computing. In NSDI","author":"Agarwal S.","year":"2012","unstructured":"S. Agarwal , S. Kandula , N. Bruno , M.-C. Wu , I. Stoica , and J. Zhou . Re-optimizing Data-parallel Computing. In NSDI 2012 . S. Agarwal, S. Kandula, N. Bruno, M.-C. Wu, I. Stoica, and J. Zhou. Re-optimizing Data-parallel Computing. In NSDI 2012."},{"key":"e_1_3_2_2_15_1","volume-title":"Reoptimizing Data Parallel Computing. In NSDI'12","author":"Agarwal S.","year":"2012","unstructured":"S. Agarwal , S. Kandula , N. Bruno , M.-C. Wu , I. Stoica , and J. Zhou . Reoptimizing Data Parallel Computing. In NSDI'12 , 2012 . S. Agarwal, S. Kandula, N. Bruno, M.-C. Wu, I. Stoica, and J. Zhou. Reoptimizing Data Parallel Computing. In NSDI'12, 2012."},{"key":"e_1_3_2_2_16_1","volume-title":"USENIX ATC","author":"Ahmad F.","year":"2014","unstructured":"F. Ahmad , S. T. Chakradhar , A. Raghunathan , and T. N. Vijaykumar . ShuffleWatcher: Shuffle-aware Scheduling in Multi-tenant MapReduce Clusters . In USENIX ATC , 2014 . F. Ahmad, S. T. Chakradhar, A. Raghunathan, and T. N. Vijaykumar. ShuffleWatcher: Shuffle-aware Scheduling in Multi-tenant MapReduce Clusters. In USENIX ATC, 2014."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966472"},{"key":"e_1_3_2_2_18_1","volume-title":"NSDI","author":"Ananthanarayanan G.","year":"2012","unstructured":"G. Ananthanarayanan , A. Ghodsi , A. Wang , D. Borthakur , S. Kandula , S. Shenker , and I. Stoica . PACMan: Coordinated Memory Caching for Parallel Jobs . In NSDI , 2012 . G. Ananthanarayanan, A. Ghodsi, A. Wang, D. Borthakur, S. Kandula, S. Shenker, and I. Stoica. PACMan: Coordinated Memory Caching for Parallel Jobs. In NSDI, 2012."},{"key":"e_1_3_2_2_19_1","first-page":"61801","article-title":"An approximate algorithm for the partitionable independent task scheduling problem","volume":"51","author":"Belkhale K. P.","year":"1990","unstructured":"K. P. Belkhale and P. Banerjee . An approximate algorithm for the partitionable independent task scheduling problem . Urbana , 51 : 61801 , 1990 . K. P. Belkhale and P. Banerjee. An approximate algorithm for the partitionable independent task scheduling problem. Urbana, 51:61801, 1990.","journal-title":"Urbana"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454166"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2011.12"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486021"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018448"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626315"},{"key":"e_1_3_2_2_25_1","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . Mapreduce: Simplified data processing on large clusters . In OSDI , 2004 . J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, 2004."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626322"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0402042"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536225"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002943"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168847"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626334"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038934"},{"key":"e_1_3_2_2_34_1","volume-title":"CIDR","author":"Herodotou H.","year":"2011","unstructured":"H. Herodotou , H. Lim , G. Luo , N. Borisov , L. Dong , F. B. Cetin , and S. Babu . Starfish: A Self-tuning System for Big Data Analytics . In CIDR , 2011 . H. Herodotou, H. Lim, G. Luo, N. Borisov, L. Dong, F. B. Cetin, and S. Babu. Starfish: A Self-tuning System for Big Data Analytics. In CIDR, 2011."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342389"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629601"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391239"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/344588.344618"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213840"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054102001308"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2287076.2287110"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536234"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063462"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687609"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/140901.141909"},{"key":"e_1_3_2_2_46_1","volume-title":"MASCOTS","author":"Wang G.","year":"2009","unstructured":"G. Wang , A. Butt , P. Pandey , and K. Gupta . A Simulation Approach to Evaluating Design Decisions in MapReduce Setups . In MASCOTS , 2009 . G. Wang, A. Butt, P. Pandey, and K. Gupta. A Simulation Approach to Evaluating Design Decisions in MapReduce Setups. In MASCOTS, 2009."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018443"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755940"},{"key":"e_1_3_2_2_49_1","volume-title":"HotCloud","author":"Zaharia M.","year":"2010","unstructured":"M. Zaharia , M. Chowdhury , M. J. Franklin , S. Shenker , and I. Stoica . Spark: Cluster computing with working sets . In HotCloud , 2010 . M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica. Spark: Cluster computing with working sets. In HotCloud, 2010."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0280-z"}],"event":{"name":"SIGCOMM '15: ACM SIGCOMM 2015 Conference","location":"London United Kingdom","acronym":"SIGCOMM '15","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2785956.2787488","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2785956.2787488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:42:38Z","timestamp":1750210958000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2785956.2787488"}},"subtitle":["Plan When You Can"],"short-title":[],"issued":{"date-parts":[[2015,8,17]]},"references-count":50,"alternative-id":["10.1145\/2785956.2787488","10.1145\/2785956"],"URL":"https:\/\/doi.org\/10.1145\/2785956.2787488","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2829988.2787488","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,8,17]]},"assertion":[{"value":"2015-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}