{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:13:00Z","timestamp":1764936780509,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,13]],"date-time":"2015-06-13T00:00:00Z","timestamp":1434153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1349602"],"award-info":[{"award-number":["CCF-1349602"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,13]]},"DOI":"10.1145\/2755573.2755592","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"294-303","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":79,"title":["Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks"],"prefix":"10.1145","author":[{"given":"Zhen","family":"Qiu","sequence":"first","affiliation":[{"name":"Columbia University, New York, NY, USA"}]},{"given":"Cliff","family":"Stein","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}]},{"given":"Yuan","family":"Zhong","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,6,13]]},"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","unstructured":"Google dataflow. https:\/\/www.google.com\/events\/io.  Google dataflow. https:\/\/www.google.com\/events\/io."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20092"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486031"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121051"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018465"},{"key":"e_1_3_2_1_7_1","first-page":"147","article-title":"Tres observaciones sobre el algebra lineal","volume":"5","author":"Birkhoff Garrett","year":"1946","unstructured":"Garrett Birkhoff . Tres observaciones sobre el algebra lineal . Univ. Nac. Tkcum\u00e1n. Rev. A , 5 : 147 -- 151 , 1946 . Garrett Birkhoff. Tres observaciones sobre el algebra lineal. Univ. Nac. Tkcum\u00e1n. Rev. A, 5:147--151, 1946.","journal-title":"Univ. Nac. Tkcum\u00e1n. Rev. A"},{"key":"e_1_3_2_1_8_1","volume-title":"Hadoop Project Website","author":"Borthakur Dhruba","year":"2007","unstructured":"Dhruba Borthakur . The hadoop distributed file system: Architecture and design . Hadoop Project Website , 2007 . Dhruba Borthakur. The hadoop distributed file system: Architecture and design. Hadoop Project Website, 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832560"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1070.0412"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390237"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018448"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626315"},{"key":"e_1_3_2_1_14_1","first-page":"10","volume-title":"OSDI","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat . Mapreduce : Simplified data processing on large clusters . In OSDI , pages 10 -- 10 , 2004 . Jeffrey Dean and Sanjay Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 10--10, 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781794.1781804"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.3.513"},{"key":"e_1_3_2_1_18_1","volume-title":"Combinatorial Theory","author":"Hall Marshall","year":"1998","unstructured":"Marshall Hall . Combinatorial Theory . Addison-Wesley , 2 nd edition, 1998 . Marshall Hall. Combinatorial Theory. Addison-Wesley, 2nd edition, 1998.","edition":"2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535373"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322101"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.09.012"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20010618"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2010.04.011"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.893876"},{"key":"e_1_3_2_1_27_1","volume-title":"Minimizing average completion time in the presence of release dates. Mathematical Programming, 82(1--2):199--223","author":"Phillips Cynthia A.","year":"1998","unstructured":"Cynthia A. Phillips , Cliff Stein , and Joel Wein . Minimizing average completion time in the presence of release dates. Mathematical Programming, 82(1--2):199--223 , 1998 . Cynthia A. Phillips, Cliff Stein, and Joel Wein. Minimizing average completion time in the presence of release dates. Mathematical Programming, 82(1--2):199--223, 1998."},{"key":"e_1_3_2_1_28_1","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo Michael","year":"2008","unstructured":"Michael Pinedo . Scheduling: Theory, Algorithms, and Systems . Springer , New York, NY, USA , 3 rd edition, 2008 . Michael Pinedo. Scheduling: Theory, Algorithms, and Systems. Springer, New York, NY, USA, 3rd edition, 2008.","edition":"3"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070562.2070584"},{"key":"e_1_3_2_1_30_1","first-page":"301","volume-title":"Integer Programming and Combinatorial Optimization","author":"Roemer Thomas A.","year":"2006","unstructured":"Thomas A. Roemer . A note on the complexity of the concurrent open shop problem . In Integer Programming and Combinatorial Optimization , pages 301 -- 315 , 2006 . Thomas A. Roemer. A note on the complexity of the concurrent open shop problem. In Integer Programming and Combinatorial Optimization, pages 301--315, 2006."},{"key":"e_1_3_2_1_31_1","volume-title":"On queue-size scaling for input-queued switches. preprint","author":"Shah Devavrat","year":"2014","unstructured":"Devavrat Shah , John. N. Tsitsiklis , and Yuan Zhong . On queue-size scaling for input-queued switches. preprint , 2014 . Devavrat Shah, John. N. Tsitsiklis, and Yuan Zhong. On queue-size scaling for input-queued switches. preprint, 2014."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Martin\n      Skutella\n    .\n  List Scheduling in Order of \u03b1-Points on a Single Machine volume \n  3484\n   of \n  Lecture Notes in Computer Science pages \n  250\n  --\n  291\n  . \n  Springer Berlin Heidelberg 2006\n  .   Martin Skutella. List Scheduling in Order of \u03b1-Points on a Single Machine volume 3484 of Lecture Notes in Computer Science pages 250--291. Springer Berlin Heidelberg 2006.","DOI":"10.1007\/11671541_9"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(97)00151-5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2005.09.007"},{"key":"e_1_3_2_1_36_1","first-page":"2","volume-title":"NSDI","author":"Zaharia Matei","year":"2012","unstructured":"Matei Zaharia , Mosharaf Chowdhury , Tathagata Das , Ankur Dave , Justin Ma , Murphy McCauley , Michael J. Franklin , Scott Shenker , and Ion Stoica . Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing . In NSDI , pages 2 -- 2 , 2012 . Matei Zaharia, Mosharaf Chowdhury, Tathagata Das, Ankur Dave, Justin Ma, Murphy McCauley, Michael J. Franklin, Scott Shenker, and Ion Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In NSDI, pages 2--2, 2012."}],"event":{"name":"SPAA '15: 27th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Portland Oregon USA","acronym":"SPAA '15"},"container-title":["Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755573.2755592","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2755573.2755592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:17:05Z","timestamp":1750227425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755573.2755592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,13]]},"references-count":35,"alternative-id":["10.1145\/2755573.2755592","10.1145\/2755573"],"URL":"https:\/\/doi.org\/10.1145\/2755573.2755592","relation":{},"subject":[],"published":{"date-parts":[[2015,6,13]]},"assertion":[{"value":"2015-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}