{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:13Z","timestamp":1750220833055,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["CCF-1909363"],"award-info":[{"award-number":["CCF-1909363"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400218","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"305-315","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling Flows on a Switch to Optimize Response Times"],"prefix":"10.1145","author":[{"given":"Hamidreza","family":"Jahanjou","sequence":"first","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Stalfa","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59250-3_2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486031"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.10.006"},{"key":"e_1_3_2_1_4_1","volume-title":"Introduction to Sequencing and Scheduling","author":"Baker K. R.","year":"1974","unstructured":"K. R. Baker . Introduction to Sequencing and Scheduling . Wiley , New York , 1974 . K. R. Baker. Introduction to Sequencing and Scheduling. Wiley, New York, 1974."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018465"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496904"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746601"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00079"},{"key":"e_1_3_2_1_10_1","first-page":"270","volume-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Bender M.","year":"1998","unstructured":"M. Bender , S. Chakrabarti , and S. Muthukrishnan . Flow and stretch metrics for scheduling continuous job streams . In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 270 -- 279 , January 1998 . M. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 270--279, January 1998."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1737"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1243401.1243407"},{"key":"e_1_3_2_1_13_1","first-page":"147","article-title":"Tres observaciones sobre el algebra lineal. Universidad Nacional de Tucuman Revista","volume":"5","author":"Birkhoff D.","year":"1946","unstructured":"D. Birkhoff . Tres observaciones sobre el algebra lineal. Universidad Nacional de Tucuman Revista , Serie A , 5 : 147 -- 151 , 1946 . D. Birkhoff. Tres observaciones sobre el algebra lineal. Universidad Nacional de Tucuman Revista, Serie A, 5:147--151, 1946.","journal-title":"Serie A"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380778"},{"key":"e_1_3_2_1_15_1","first-page":"123","volume-title":"The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2019","author":"Chowdhury M.","year":"2019","unstructured":"M. Chowdhury , S. Khuller , M. Purohit , S. Yang , and J. You . Near optimal coflow scheduling in networks. In Christian Scheideler and Petra Berenbrink, editors , The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2019 , Phoenix, AZ, USA, June 22--24 , 2019 , pages 123 -- 134 . ACM, 2019. M. Chowdhury, S. Khuller, M. Purohit, S. Yang, and J. You. Near optimal coflow scheduling in networks. In Christian Scheideler and Petra Berenbrink, editors, The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22--24, 2019, pages 123--134. ACM, 2019."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626315"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155537"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90100-V"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111336"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205048"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310531"},{"key":"e_1_3_2_1_22_1","first-page":"181","volume-title":"Better algorithms for minimizing average flow-time on related machines","author":"Garg N.","year":"2006","unstructured":"N. Garg and A. Kumar . Better algorithms for minimizing average flow-time on related machines . In Michele Bugliesi, Bart Preneel, Vladimiro Sassone, and Ingo Wegener, editors, Automata, Languages and Programming, pages 181 -- 190 , Berlin, Heidelberg, 2006 . Springer Berlin Heidelberg . N. Garg and A. Kumar. Better algorithms for minimizing average flow-time on related machines. In Michele Bugliesi, Bart Preneel, Vladimiro Sassone, and Ingo Wegener, editors, Automata, Languages and Programming, pages 181--190, Berlin, Heidelberg, 2006. Springer Berlin Heidelberg."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.52"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92182-0_39"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.810496"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.1999.815375"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078505.3078509"},{"key":"e_1_3_2_1_28_1","volume-title":"Software Defined Networks: A Comprehensive Approach","author":"Goransson P.","year":"2014","unstructured":"P. Goransson and C. Black . Software Defined Networks: A Comprehensive Approach . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA, 1 st edition, 2014 . P. Goransson and C. Black. Software Defined Networks: A Comprehensive Approach. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1st edition, 2014.","edition":"1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2018.10.001"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087567"},{"key":"e_1_3_2_1_32_1","volume-title":"May","author":"Jahanjou H.","year":"2020","unstructured":"H. Jahanjou , R. Rajaraman , and D. Stalfa . Scheduling flows on a switch to optimize response times. arXiv: https:\/\/arxiv.org\/abs\/2005.09724 , May 2020 . H. Jahanjou, R. Rajaraman, and D. Stalfa. Scheduling flows on a switch to optimize response times. arXiv: https:\/\/arxiv.org\/abs\/2005.09724, May 2020."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056969"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646123"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535373"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840353"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237989"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935809"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2371999"},{"key":"e_1_3_2_1_40_1","first-page":"869","article-title":"An approximation algorithm for diagnostic test scheduling in multicomputer systems","volume":"34","author":"Kubale M.","year":"1985","unstructured":"M. Kubale and H. Krawczyk . An approximation algorithm for diagnostic test scheduling in multicomputer systems . IEEE Transactions on Computers , 34 : 869 -- 872 , 09 1985 . M. Kubale and H. Krawczyk. An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Transactions on Computers, 34:869--872, 09 1985.","journal-title":"IEEE Transactions on Computers"},{"key":"e_1_3_2_1_41_1","unstructured":"J. Kulkarni. Personal communication.  J. Kulkarni. Personal communication."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322101"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258562"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155246"},{"key":"e_1_3_2_1_45_1","first-page":"49","volume-title":"Scheduling to Minimize Max Flow Time: Offline and Online Algorithms","author":"Mastrolilli M.","year":"2003","unstructured":"M. Mastrolilli . Scheduling to Minimize Max Flow Time: Offline and Online Algorithms , pages 49 -- 60 . Springer Berlin Heidelberg , Berlin, Heidelberg , 2003 . M. Mastrolilli. Scheduling to Minimize Max Flow Time: Offline and Online Algorithms, pages 49--60. Springer Berlin Heidelberg, Berlin, Heidelberg, 2003."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592575"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755592"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755592"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2845852"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-AAP763"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218408"}],"event":{"name":"SPAA '20: 32nd 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","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400218","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:35Z","timestamp":1750202015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":50,"alternative-id":["10.1145\/3350755.3400218","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400218","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}