Non-Splitting Coflow Scheduling

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks

arXiv:2501.09293v5 Announce Type: replace Abstract: As a prominent network abstraction, coflow models efficiently capture communication patterns in data centers. Since coflow scheduling in large-scale data centers is $\mathcal{NP}$-hard, the existing literature has predominantly focused on limited environments with $m=2$ network cores, relying on flow splitting, which introduces substantial operational overhead. Crucially, no approximation algorithm with provable performance guarantees has...