Search for a command to run...
A high-performance framework for distributed computation of $k$ Disjoint Matchings. This framework is optimized for efficiently processing large-scale graphs, utilizing distributed algorithms to ensure scalability and performance.This software is part of the paper: Kathrin Hanauer, Sophia Heck, and Stefan Schmid. 2026. DistroMatch: Distributed Disjoint Weighted Matchings in Demand-Aware Reconfigurable Optical Datacenters. In 2026 International Conference on Supercomputing (ICS ’26), July 06–09, 2026, Belfast, United Kingdom. ACM, New York, NY, USA. https://doi.org/10.1145/3797905.3800555 If you use the code please cite: @inproceedings{distromatch, author = {Kathrin Hanauer, Sophia Heck, Stefan Schmid}, title = {DistroMatch: Distributed Disjoint Weighted Matchings in Demand-Aware Reconfigurable Optical Datacenters}, booktitle = {2026 International Conference on Supercomputing (ICS ’26)}, publisher = {ACM}, year = {2026}, doi = {10.1145/3797905.3800555}}