An LP-guided coflow scheduler for K-core OCS networks achieves O(K) approximation of weighted coflow completion time under not-all-stop reconfiguration.
Decentralized task-aware scheduling for data center networks
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
An approximation algorithm jointly assigns coflow traffic across heterogeneous OCS cores and schedules per-core circuits under not-all-stop reconfiguration to minimize weighted coflow completion time with a worst-case guarantee.
citing papers explorer
-
An O(K)-Approximation Coflow Scheduling in K-Core Optical Circuit Switching Networks
An LP-guided coflow scheduler for K-core OCS networks achieves O(K) approximation of weighted coflow completion time under not-all-stop reconfiguration.
-
Scheduling Coflows in Multi-Core OCS Networks with Performance Guarantee
An approximation algorithm jointly assigns coflow traffic across heterogeneous OCS cores and schedules per-core circuits under not-all-stop reconfiguration to minimize weighted coflow completion time with a worst-case guarantee.