{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T15:25:16Z","timestamp":1759073116913,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council (ERC)","award":["864228"],"award-info":[{"award-number":["864228"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461786","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"318-327","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters"],"prefix":"10.1145","author":[{"given":"Janardhan","family":"Kulkarni","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}]},{"given":"Pawe\u0142","family":"Schmidt","sequence":"additional","affiliation":[{"name":"University of Wroclaw, Wroclaw, Poland"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592577"},{"key":"e_1_3_2_1_4_1","first-page":"348","volume-title":"Storage and Analysis","author":"Besta M.","year":"2014","unstructured":"M. Besta and T. Hoefler , \" Slim fly: A cost effective low-diameter network topology,\" in SC'14: Proceedings of the International Conference for High Performance Computing, Networking , Storage and Analysis , pp. 348 -- 359 , IEEE, 2014 . M. Besta and T. Hoefler, \"Slim fly: A cost effective low-diameter network topology,\" in SC'14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 348--359, IEEE, 2014."},{"key":"e_1_3_2_1_5_1","first-page":"225","volume-title":"Jellyfish: Networking data centers randomly,\" in Presented as part of the 9th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 12)","author":"Singla A.","year":"2012","unstructured":"A. Singla , C.-Y. Hong , L. Popa , and P. B. Godfrey , \" Jellyfish: Networking data centers randomly,\" in Presented as part of the 9th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 12) , pp. 225 -- 238 , 2012 . A. Singla, C.-Y. Hong, L. Popa, and P. B. Godfrey, \"Jellyfish: Networking data centers randomly,\" in Presented as part of the 9th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 12), pp. 225--238, 2012."},{"key":"e_1_3_2_1_6_1","volume-title":"ACM","author":"Kassing S.","year":"2017","unstructured":"S. Kassing , A. Valadarsky , G. Shahaf , M. Schapira , and A. Singla , \" Beyond fat-trees without antennae, mirrors, and disco-balls,\" in Proceedings of the Conference of the ACM Special Interest Group on Data Communication, pp. 281--294 , ACM , 2017 . S. Kassing, A. Valadarsky, G. Shahaf, M. Schapira, and A. Singla, \"Beyond fat-trees without antennae, mirrors, and disco-balls,\" in Proceedings of the Conference of the ACM Special Interest Group on Data Communication, pp. 281--294, ACM, 2017."},{"key":"e_1_3_2_1_7_1","volume-title":"Expanding across time to deliver bandwidth efficiency and low latency,\" arXiv preprint arXiv:1903.12307","author":"Mellette W. M.","year":"2019","unstructured":"W. M. Mellette , R. Das , Y. Guo , R. McGuinness , A. C. Snoeren , and G. Porter , \" Expanding across time to deliver bandwidth efficiency and low latency,\" arXiv preprint arXiv:1903.12307 , 2019 . W. M. Mellette, R. Das, Y. Guo, R. McGuinness, A. C. Snoeren, and G. Porter, \"Expanding across time to deliver bandwidth efficiency and low latency,\" arXiv preprint arXiv:1903.12307, 2019."},{"key":"e_1_3_2_1_8_1","volume-title":"ACM","author":"Mellette W. M.","year":"2017","unstructured":"W. M. Mellette , R. McGuinness , A. Roy , A. Forencich , G. Papen , A. C. Snoeren , and G. Porter , \" Rotornet: A scalable, low-complexity, optical datacenter network,\" in Proceedings of the Conference of the ACM Special Interest Group on Data Communication, pp. 267--280 , ACM , 2017 . W. M. Mellette, R. McGuinness, A. Roy, A. Forencich, G. Papen, A. C. Snoeren, and G. Porter, \"Rotornet: A scalable, low-complexity, optical datacenter network,\" in Proceedings of the Conference of the ACM Special Interest Group on Data Communication, pp. 267--280, ACM, 2017."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851223"},{"volume-title":"c-through: Part-time optics in data centers,\" ACM SIGCOMM Computer Communication Review","author":"Wang G.","key":"e_1_3_2_1_10_1","unstructured":"G. Wang , D. G. Andersen , M. Kaminsky , K. Papagiannaki , T. Ng , M. Kozuch , and M. Ryan , \" c-through: Part-time optics in data centers,\" ACM SIGCOMM Computer Communication Review , vol. 41 , no. 4, pp. 327--338, 2011. G. Wang, D. G. Andersen, M. Kaminsky, K. Papagiannaki, T. Ng, M. Kozuch, and M. Ryan, \"c-through: Part-time optics in data centers,\" ACM SIGCOMM Computer Communication Review, vol. 41, no. 4, pp. 327--338, 2011."},{"key":"e_1_3_2_1_11_1","volume-title":"ACM","author":"Ghobadi M.","year":"2016","unstructured":"M. Ghobadi , R. Mahajan , A. Phanishayee , N. Devanur , J. Kulkarni , G. Ranade , P.-A. Blanche , H. Rastegarfar , M. Glick , and D. Kilper , \" Projector: Agile reconfigurable data center interconnect,\" in Proceedings of the 2016 ACM SIGCOMM Conference, pp. 216--229 , ACM , 2016 . M. Ghobadi, R. Mahajan, A. Phanishayee, N. Devanur, J. Kulkarni, G. Ranade, P.-A. Blanche, H. Rastegarfar, M. Glick, and D. Kilper, \"Projector: Agile reconfigurable data center interconnect,\" in Proceedings of the 2016 ACM SIGCOMM Conference, pp. 216--229, ACM, 2016."},{"key":"e_1_3_2_1_12_1","first-page":"1","article-title":"Demand-aware network designs of bounded degree","author":"Avin C.","year":"2017","unstructured":"C. Avin , K. Mondal , and S. Schmid , \" Demand-aware network designs of bounded degree ,\" Distributed Computing , pp. 1 -- 15 , 2017 . C. Avin, K. Mondal, and S. Schmid, \"Demand-aware network designs of bounded degree,\" Distributed Computing, pp. 1--15, 2017.","journal-title":"Distributed Computing"},{"key":"e_1_3_2_1_13_1","unstructured":"H. Ballani P. Costa R. Behrendt D. Cletheroe I. Haller K. Jozwik F. Karinou S. Lange K. Shi B. Thomsen etal \"Sirius: A flat datacenter network with nanosecond optical switching \" in Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications technologies architectures and protocols for computer communication pp. 782--797 2020.  H. Ballani P. Costa R. Behrendt D. Cletheroe I. Haller K. Jozwik F. Karinou S. Lange K. Shi B. Thomsen et al. \"Sirius: A flat datacenter network with nanosecond optical switching \" in Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications technologies architectures and protocols for computer communication pp. 782--797 2020."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2410313"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901479"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3224421"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787472"},{"key":"e_1_3_2_1_18_1","volume-title":"ACM","author":"Benson T.","year":"2010","unstructured":"T. Benson , A. Akella , and D. A. Maltz , \" Network traffic characteristics of data centers in the wild,\" in Proceedings of the 10th ACM SIGCOMM conference on Internet measurement, pp. 267--280 , ACM , 2010 . T. Benson, A. Akella, and D. A. Maltz, \"Network traffic characteristics of data centers in the wild,\" in Proceedings of the 10th ACM SIGCOMM conference on Internet measurement, pp. 267--280, ACM, 2010."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394205"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"N. McKeown \"The islip scheduling algorithm for input-queued switches \" IEEE\/ACM transactions on networking vol. 7 no. 2 pp. 188--201 1999.  N. McKeown \"The islip scheduling algorithm for input-queued switches \" IEEE\/ACM transactions on networking vol. 7 no. 2 pp. 188--201 1999.","DOI":"10.1109\/90.769767"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.772430"},{"key":"e_1_3_2_1_22_1","first-page":"1043","volume-title":"Scheduling for weighted flow and completion times in reconfigurable networks,\" in IEEE Conference on Computer Communications (INFOCOM)","author":"Dinitz M.","year":"2020","unstructured":"M. Dinitz and B. Moseley , \" Scheduling for weighted flow and completion times in reconfigurable networks,\" in IEEE Conference on Computer Communications (INFOCOM) , pp. 1043 -- 1052 , 2020 . M. Dinitz and B. Moseley, \"Scheduling for weighted flow and completion times in reconfigurable networks,\" in IEEE Conference on Computer Communications (INFOCOM), pp. 1043--1052, 2020."},{"key":"e_1_3_2_1_23_1","first-page":"1228","volume-title":"Resource augmentation for weighted flow-time explained by dual fitting,\" in Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms","author":"Anand S.","year":"2012","unstructured":"S. Anand , N. Garg , and A. Kumar , \" Resource augmentation for weighted flow-time explained by dual fitting,\" in Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms , pp. 1228 -- 1241 , SIAM , 2012 . S. Anand, N. Garg, and A. Kumar, \"Resource augmentation for weighted flow-time explained by dual fitting,\" in Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pp. 1228--1241, SIAM, 2012."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536506"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1643707"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377761"},{"key":"e_1_3_2_1_29_1","volume-title":"ACM Workshop on Hot Topics in Networks (HotNets)","author":"Kandula S.","year":"2009","unstructured":"S. Kandula , J. Padhye , and P. Bahl , \" Flyways to de-congest data center networks,\" in Proc . ACM Workshop on Hot Topics in Networks (HotNets) , 2009 . S. Kandula, J. Padhye, and P. Bahl, \"Flyways to de-congest data center networks,\" in Proc. ACM Workshop on Hot Topics in Networks (HotNets), 2009."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626328"},{"key":"e_1_3_2_1_31_1","first-page":"577","volume-title":"NSDI'17","author":"Chen L.","year":"2017","unstructured":"L. Chen , K. Chen , Z. Zhu , M. Yu , G. Porter , C. Qiao , and S. Zhong , \" Enabling wide-spread communications on optical fabric with megaswitch,\" in Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation , NSDI'17 , (USA), pp. 577 -- 593 , USENIX Association , 2017 . L. Chen, K. Chen, Z. Zhu, M. Yu, G. Porter, C. Qiao, and S. Zhong, \"Enabling wide-spread communications on optical fabric with megaswitch,\" in Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation, NSDI'17, (USA), pp. 577--593, USENIX Association, 2017."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626332"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"e_1_3_2_1_35_1","first-page":"399","volume-title":"F10: A fault-tolerant engineered network,\" in Presented as part of the 10th {USENIX} Symposium on Networked Systems Design and Implementation (NSDI)","author":"Liu V.","year":"2013","unstructured":"V. Liu , D. Halperin , A. Krishnamurthy , and T. Anderson , \" F10: A fault-tolerant engineered network,\" in Presented as part of the 10th {USENIX} Symposium on Networked Systems Design and Implementation (NSDI) , pp. 399 -- 412 , 2013 . V. Liu, D. Halperin, A. Krishnamurthy, and T. Anderson, \"F10: A fault-tolerant engineered network,\" in Presented as part of the 10th {USENIX} Symposium on Networked Systems Design and Implementation (NSDI), pp. 399--412, 2013."},{"key":"e_1_3_2_1_36_1","first-page":"25","volume-title":"Mdcube: a high performance network structure for modular data center interconnection,\" in Proceedings of the 5th international conference on Emerging networking experiments and technologies","author":"Wu H.","year":"2009","unstructured":"H. Wu , G. Lu , D. Li , C. Guo , and Y. Zhang , \" Mdcube: a high performance network structure for modular data center interconnection,\" in Proceedings of the 5th international conference on Emerging networking experiments and technologies , pp. 25 -- 36 , ACM , 2009 . H. Wu, G. Lu, D. Li, C. Guo, and Y. Zhang, \"Mdcube: a high performance network structure for modular data center interconnection,\" in Proceedings of the 5th international conference on Emerging networking experiments and technologies, pp. 25--36, ACM, 2009."},{"key":"e_1_3_2_1_37_1","first-page":"17","volume-title":"USENIX Symposium on Networked Systems Design and Implementation (NSDI)","volume":"12","author":"Singla A.","year":"2012","unstructured":"A. Singla , C.-Y. Hong , L. Popa , and P. B. Godfrey , \" Jellyfish: Networking data centers, randomly.,\" in Proc . USENIX Symposium on Networked Systems Design and Implementation (NSDI) , vol. 12 , pp. 17 -- 17 , 2012 . A. Singla, C.-Y. Hong, L. Popa, and P. B. Godfrey, \"Jellyfish: Networking data centers, randomly.,\" in Proc. USENIX Symposium on Networked Systems Design and Implementation (NSDI), vol. 12, pp. 17--17, 2012."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2378956.2378964"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.03.025"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3131365.3131375"},{"key":"e_1_3_2_1_42_1","volume-title":"ACM","author":"Singla A.","year":"2010","unstructured":"A. Singla , A. Singh , K. Ramachandran , L. Xu , and Y. Zhang , \" Proteus: a topology malleable data center network,\" in Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks, p. 8 , ACM , 2010 . A. Singla, A. Singh, K. Ramachandran, L. Xu, and Y. Zhang, \"Proteus: a topology malleable data center network,\" in Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks, p. 8, ACM, 2010."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"e_1_3_2_1_44_1","volume-title":"International Symposium on Distributed Computing (DISC)","author":"Avin C.","year":"2017","unstructured":"C. Avin , K. Mondal , and S. Schmid , \" Demand-aware network designs of bounded degree,\" in Proc . International Symposium on Distributed Computing (DISC) , 2017 . C. Avin, K. Mondal, and S. Schmid, \"Demand-aware network designs of bounded degree,\" in Proc. International Symposium on Distributed Computing (DISC), 2017."},{"issue":"3","key":"e_1_3_2_1_45_1","first-page":"4","article-title":"Costly circuits, submodular schedules and approximate carath\u00e9odory theorems","volume":"88","author":"Venkatakrishnan S. B.","year":"2018","unstructured":"S. B. Venkatakrishnan , M. Alizadeh , and P. Viswanath , \" Costly circuits, submodular schedules and approximate carath\u00e9odory theorems ,\" Queueing Systems , vol. 88 , no. 3 -- 4 , pp. 311--347, 2018 . S. B. Venkatakrishnan, M. Alizadeh, and P. Viswanath, \"Costly circuits, submodular schedules and approximate carath\u00e9odory theorems,\" Queueing Systems, vol. 88, no. 3--4, pp. 311--347, 2018.","journal-title":"Queueing Systems"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486007"},{"key":"e_1_3_2_1_47_1","volume-title":"Measurements and Evaluation (PERFORMANCE)","author":"Bienkowski M.","year":"2014","unstructured":"M. Bienkowski , D. Fuchssteiner , J. Marcinkowski , and S. Schmid , \" Online dynamic b-matching with applications to reconfigurable datacenter networks,\" in 38th International Symposium on Computer Performance, Modeling , Measurements and Evaluation (PERFORMANCE) , 2014 . M. Bienkowski, D. Fuchssteiner, J. Marcinkowski, and S. Schmid, \"Online dynamic b-matching with applications to reconfigurable datacenter networks,\" in 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE), 2014."},{"key":"e_1_3_2_1_48_1","volume-title":"Renets: Toward statically optimal self-adjusting networks,\" arXiv preprint arXiv:1904.03263","author":"Avin C.","year":"2019","unstructured":"C. Avin and S. Schmid , \" Renets: Toward statically optimal self-adjusting networks,\" arXiv preprint arXiv:1904.03263 , 2019 . C. Avin and S. Schmid, \"Renets: Toward statically optimal self-adjusting networks,\" arXiv preprint arXiv:1904.03263, 2019."},{"key":"e_1_3_2_1_49_1","volume-title":"Online and offline greedy algorithms for routing with switching costs,\" arXiv preprint arXiv:1905.02800","author":"Schwartz R.","year":"2019","unstructured":"R. Schwartz , M. Singh , and S. Yazdanbod , \" Online and offline greedy algorithms for routing with switching costs,\" arXiv preprint arXiv:1905.02800 , 2019 . R. Schwartz, M. Singh, and S. Yazdanbod, \"Online and offline greedy algorithms for routing with switching costs,\" arXiv preprint arXiv:1905.02800, 2019."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.780463"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.379487"}],"event":{"name":"SPAA '21: 33rd 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 '21"},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461786","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":51,"alternative-id":["10.1145\/3409964.3461786","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461786","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}