{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T13:44:58Z","timestamp":1782999898612,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T00:00:00Z","timestamp":1783209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"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":[[2026,7,6]]},"DOI":"10.1145\/3797905.3800555","type":"proceedings-article","created":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T11:50:37Z","timestamp":1782993037000},"page":"409-421","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["DistroMatch: Distributed Disjoint Weighted Matchings in Demand-Aware Reconfigurable Optical Datacenters"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5945-837X","authenticated-orcid":false,"given":"Kathrin","family":"Hanauer","sequence":"first","affiliation":[{"name":"Faculty of Computer Science, University of Vienna, Vienna, Austria and Research Network Data Science, University of Vienna, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5971-3051","authenticated-orcid":false,"given":"Sophia","family":"Heck","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, University of Vienna, Vienna, Austria and Doctoral School Computer Science, University of Vienna, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin and Fraunhofer SIT, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,5]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","unstructured":"Vamsi Addanki Chen Avin and Stefan Schmid. 2023. Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. Proc. ACM Meas. Anal. Comput. Syst. 7 1 Article 2 (mar 2023) 43\u00a0pages. 10.1145\/3579312","DOI":"10.1145\/3579312"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","unstructured":"Akanksha Agrawal Madhumita Kundu Abhishek Sahu Saket Saurabh and Prafullkumar Tale. 2022. Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica 84 10 (2022) 3075\u20133100. 10.1007\/S00453-022-01003-0","DOI":"10.1007\/S00453-022-01003-0"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3651890.3672248"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3708980"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3406221"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","unstructured":"Casey Battaglino Pienta Pienta and Richard Vuduc. 2015. GraSP: distributed streaming graph partitioning. Barcelona Supercomputing Center. 10.5821\/hpgm15.3Accepted: 2015-07-29T11:40:29Z.","DOI":"10.5821\/hpgm15.3"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","unstructured":"Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki Vahab\u00a0S. Mirrokni and Warren Schudy. 2021. Massively Parallel Computation via Remote Memory Access. ACM Trans. Parallel Comput. 8 3 (2021) 13:1\u201313:25. 10.1145\/3470631","DOI":"10.1145\/3470631"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","unstructured":"Marcin Bienkowski David Fuchssteiner Jan Marcinkowski and Stefan Schmid. 2020. Online Dynamic B-Matching: With Applications to Reconfigurable Datacenter Networks. SIGMETRICS Perform. Evaluation Rev. 48 3 (2020) 99\u2013108. 10.1145\/3453953.3453976","DOI":"10.1145\/3453953.3453976"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3607057"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Davide Bil\u00f2 Luciano Gual\u00e0 and Guido Proietti. 2012. Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. 417 (2012) 12\u201322. 10.1016\/J.TCS.2011.05.014","DOI":"10.1016\/J.TCS.2011.05.014"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40047-6_66"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Kai Chen Ankit Singla Atul Singh Kishore Ramachandran Lei Xu Yueping Zhang Xitao Wen and Yan Chen. 2014. OSA: An optical switching architecture for data center networks with unprecedented flexibility. IEEE\/ACM Transactions on Networking (TON) 22 2 (2014) 498\u2013511.","DOI":"10.1109\/TNET.2013.2253120"},{"key":"e_1_3_3_2_15_2","first-page":"577","volume-title":"Proc. 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17)","author":"Chen Li","year":"2017","unstructured":"Li Chen, Kai Chen, Zhonghua Zhu, Minlan Yu, George Porter, Chunming Qiao, and Shan Zhong. 2017. Enabling Wide-Spread Communications on Optical Fabric with Megaswitch. In Proc. 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17) (Boston, MA, USA). USA, 577\u2013593."},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","unstructured":"Zhi-Zhong Chen Sayuri Konno and Yuki Matsushita. 2010. Approximating maximum edge 2-coloring in simple graphs. 158 17 (2010) 1894\u20131901. 10.1016\/J.DAM.2010.08.010","DOI":"10.1016\/J.DAM.2010.08.010"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","unstructured":"Timothy\u00a0A. Davis and Yifan Hu. 2011. The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38 1 (Dec. 2011) 1:1\u20131:25. 10.1145\/2049662.2049663","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_39"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155537"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.SAND.2025.4"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","unstructured":"Marcelo\u00a0Fonseca Faraj and Christian Schulz. 2022. Buffered Streaming Graph Partitioning. ACM Journal of Experimental Algorithmics 27 (Dec. 2022) 1\u201326. 10.1145\/3546911","DOI":"10.1145\/3546911"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Nathan Farrington George Porter Sivasankar Radhakrishnan Hamid\u00a0Hajabdolali Bazzaz Vikram Subramanya Yeshaiahu Fainman George Papen and Amin Vahdat. 2011. Helios: a hybrid electrical\/optical switch architecture for modular data centers. ACM SIGCOMM Comput. Commun. Rev. (CCR) 41 4 (2011) 339\u2013350.","DOI":"10.1145\/1851275.1851223"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","unstructured":"Lene\u00a0M. Favrholdt and Morten\u00a0N. Nielsen. 2003. On-Line Edge-Coloring with a Fixed Number of Colors. Algorithmica 35 2 (2003) 176\u2013191. 10.1007\/S00453-002-0992-3","DOI":"10.1007\/S00453-002-0992-3"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45753-4_11"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976830.5"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ESA.2024.53"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","unstructured":"Andrew Gozzard Max Ward and Amitava Datta. 2018. Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition. Inf. Sci. 422 (2018) 282\u2013289. 10.1016\/J.INS.2017.09.020","DOI":"10.1016\/J.INS.2017.09.020"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"crossref","unstructured":"Chen Griner Johannes Zerwas Andreas Blenk Manya Ghobadi Stefan Schmid and Chen Avin. 2021. Cerberus: The Power of Choices in Datacenter Topology Design (A Throughput Perspective). Proc. ACM SIGMETRICS (2021) 1\u201333.","DOI":"10.1145\/3491050"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SWAT.2020.26"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"crossref","unstructured":"Matthew\u00a0Nance Hall Klaus-Tycho Foerster Stefan Schmid and Ramakrishnan Durairajan. 2021. A survey of reconfigurable optical networks. Optical Switching and Networking 41 (2021) 100621.","DOI":"10.1016\/j.osn.2021.100621"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","unstructured":"Subin Han Eunsok Lee Hyunkyung Yoo Namseok Ko and Sangheon Pack. 2025. Demand-Aware Distributed Scheduling With Adaptive Buffer Control in Reconfigurable Data Center Networks. IEEE Trans. Cloud Comput. 13 3 (2025) 783\u2013793. 10.1109\/TCC.2025.3568369","DOI":"10.1109\/TCC.2025.3568369"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.19205433"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10229050"},{"key":"e_1_3_3_2_35_2","unstructured":"Kathrin Hanauer Monika Henzinger Lara Ost and Stefan Schmid. 2025. Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. https:\/\/arxiv.org\/abs\/2301.05751 _eprint: 2301.05751."},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796921"},{"key":"e_1_3_3_2_37_2","first-page":"94","volume-title":"Approximation algorithms for NP-hard problems","author":"Hochbaum Dorit\u00a0S.","year":"1996","unstructured":"Dorit\u00a0S. Hochbaum. 1996. Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In Approximation algorithms for NP-hard problems. PWS Publishing Co., USA, 94\u2013143."},{"key":"e_1_3_3_2_38_2","unstructured":"Jaap-Henk Hoepman. 2004. Simple Distributed Weighted Matchings. CoRR cs.DC\/0410047 (2004). http:\/\/arxiv.org\/abs\/cs.DC\/0410047"},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","unstructured":"Marcin\u00a0Jakub Kaminski and Lukasz Kowalik. 2014. Beyond the Vizing\u2019s Bound for at Most Seven Colors. SIAM J. Discret. Math. 28 3 (2014) 1334\u20131362. 10.1137\/120899765","DOI":"10.1137\/120899765"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"publisher","unstructured":"George Karypis and Vipin Kumar. 1998. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Sci. Comput. 20 1 (1998) 359\u2013392. 10.1137\/S1064827595287997","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"publisher","unstructured":"Wolfgang Kellerer Patrick Kalmbach Andreas Blenk Arsany Basta Martin Reisslein and Stefan Schmid. 2019. Adaptable and Data-Driven Softwarized Networks: Review Opportunities and Challenges. Proc. IEEE 107 4 (2019) 711\u2013731. 10.1109\/JPROC.2019.2895553","DOI":"10.1109\/JPROC.2019.2895553"},{"key":"e_1_3_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.65"},{"key":"e_1_3_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461786"},{"key":"e_1_3_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342085"},{"key":"e_1_3_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.61"},{"key":"e_1_3_3_2_46_2","doi-asserted-by":"publisher","unstructured":"Nick McKeown. 1999. The iSLIP scheduling algorithm for input-queued switches. IEEE\/ACM Trans. Netw. 7 2 (1999) 188\u2013201. 10.1109\/90.769767","DOI":"10.1109\/90.769767"},{"key":"e_1_3_3_2_47_2","first-page":"1","volume-title":"Proc. 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20)","author":"Mellette William\u00a0M","year":"2020","unstructured":"William\u00a0M Mellette, Rajdeep Das, Yibo Guo, Rob McGuinness, Alex\u00a0C Snoeren, and George Porter. 2020. Expanding across time to deliver bandwidth efficiency and low latency. In Proc. 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20). 1\u201318."},{"key":"e_1_3_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3651890.3672273"},{"key":"e_1_3_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"e_1_3_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_21"},{"key":"e_1_3_3_2_51_2","doi-asserted-by":"publisher","unstructured":"Jayadev Misra and David Gries. 1992. A Constructive Proof of Vizing\u2019s Theorem. Inf. Process. Lett. 41 3 (1992) 131\u2013133. 10.1016\/0020-0190(92)90041-S","DOI":"10.1016\/0020-0190(92)90041-S"},{"key":"e_1_3_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063952"},{"key":"e_1_3_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.4"},{"key":"e_1_3_3_2_54_2","doi-asserted-by":"publisher","unstructured":"Ami Paz and Gregory Schwartzman. 2019. A (2+\u03f5)-Approximation for Maximum Weight Matching in the Semi-streaming Model. ACM Trans. Algorithms 15 2 (2019) 18:1\u201318:15. 10.1145\/3274668","DOI":"10.1145\/3274668"},{"key":"e_1_3_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/3544216.3544265"},{"key":"e_1_3_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_24"},{"key":"e_1_3_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"e_1_3_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_16"},{"key":"e_1_3_3_2_59_2","unstructured":"Roy Schwartz Mohit Singh and Sina Yazdanbod. 2019. Online and Offline Greedy Algorithms for Routing with Switching Costs. CoRR abs\/1905.02800 (2019). http:\/\/arxiv.org\/abs\/1905.02800 arXiv:https:\/\/arXiv.org\/abs\/1905.02800."},{"key":"e_1_3_3_2_60_2","doi-asserted-by":"publisher","unstructured":"Arjun Singh Joon Ong Amit Agarwal Glen Anderson Ashby Armistead Roy Bannon Seb Boving Gaurav Desai Bob Felderman Paulie Germano Anand Kanagala Jeff Provost Jason Simmons Eiichi Tanda Jim Wanderer Urs H\u00f6lzle Stephen Stuart and Amin Vahdat. 2015. Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google\u2019s Datacenter Network. SIGCOMM Comput. Commun. Rev. 45 4 (2015) 183\u2013197. 10.1145\/2829988.2787508","DOI":"10.1145\/2829988.2787508"},{"key":"e_1_3_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868455"},{"key":"e_1_3_3_2_62_2","doi-asserted-by":"publisher","unstructured":"Min\u00a0Yee Teh Zhenguo Wu and Keren Bergman. 2020. Flexspander: augmenting expander networks in high-performance systems with optical bandwidth steering. JOCN 12 4 (2020) B44\u2013B54. 10.1364\/JOCN.379487","DOI":"10.1364\/JOCN.379487"},{"key":"e_1_3_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"e_1_3_3_2_64_2","doi-asserted-by":"publisher","unstructured":"Shaileshh\u00a0Bojja Venkatakrishnan Mohammad Alizadeh and Pramod Viswanath. 2018. Costly circuits submodular schedules and approximate Carath\u00e9odory Theorems. Queueing Syst. Theory Appl. 88 3-4 (2018) 311\u2013347. 10.1007\/S11134-017-9546-X","DOI":"10.1007\/S11134-017-9546-X"},{"key":"e_1_3_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851222"}],"event":{"name":"ICS '26: 2026 International Conference on Supercomputing","location":"Belfast United Kingdom","acronym":"ICS '26","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 40th ACM International Conference on Supercomputing"],"original-title":[],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T13:02:44Z","timestamp":1782997364000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3797905.3800555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,5]]},"references-count":64,"alternative-id":["10.1145\/3797905.3800555","10.1145\/3797905"],"URL":"https:\/\/doi.org\/10.1145\/3797905.3800555","relation":{},"subject":[],"published":{"date-parts":[[2026,7,5]]},"assertion":[{"value":"2026-07-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}