Technology Category
Planning, Routing, and Scheduling: Optimization of Spatio-temporal SystemsConstraint Satisfaction and Optimization: Distributed CSP/OptimizationSearch and Optimization: Algorithm Configuration
Scheduling Coflows in Multi-Core OCS Networks with Performance Guarantee
🤖 AI Summary
This work addresses the lack of effective coflow scheduling methods in multi-core optical circuit-switched (OCS) networks by proposing an approximation algorithm that jointly optimizes inter-core traffic allocation and intra-core circuit scheduling to minimize weighted coflow completion time. It presents the first theoretically grounded solution with performance guarantees for coflow scheduling in multi-core OCS environments and naturally extends to multi-core optical packet-switched networks. By explicitly modeling port exclusivity constraints and reconfiguration delays under the not-all-stop reconfiguration model, the algorithm enables efficient scheduling. Extensive simulations using real-world Facebook workloads demonstrate that the proposed approach significantly reduces both weighted and tail coflow completion times, confirming its effectiveness and practicality.
Technology Category
Application Category
📝 Abstract
Coflow provides a key application-layer abstraction for capturing communication patterns, enabling the efficient coordination of parallel data flows to reduce job completion times in distributed systems. Modern data center networks (DCNs) are employing multiple independent optical circuit switching (OCS) cores operating concurrently to meet the massive bandwidth demands of application jobs. However, existing coflow scheduling research primarily focuses on the single-core setting, with multi-core fabrics only for EPS (electrical packet switching) networks.
To address this gap, this paper studies the coflow scheduling problem in multi-core OCS networks under the not-all-stop reconfiguration model in which one circuit's reconfiguration does not interrupt other circuits. The challenges stem from two aspects: (i) cross-core coupling induced by traffic assignment across heterogeneous cores; and (ii) per-core OCS scheduling constraints, namely port exclusivity and reconfiguration delay. We propose an approximation algorithm that jointly integrates cross-core flow assignment and per-core circuit scheduling to minimize the total weighted coflow completion time (CCT) and establish a provable worst-case performance guarantee. Furthermore, our algorithm framework can be directly applied to the multi-core EPS scenario with the corresponding approximation ratio under packet-switched fabrics. Trace-driven simulations using real Facebook workloads demonstrate that our algorithm effectively reduces weighted CCT and tail CCT.
Problem
Research questions and friction points this paper is trying to address.
Coflow scheduling
Multi-core OCS networks
Performance guarantee
Cross-core coupling
Reconfiguration delay
Innovation
Methods, ideas, or system contributions that make the work stand out.
coflow scheduling
multi-core OCS
approximation algorithm
performance guarantee
optical circuit switching
🔎 Similar Papers
No similar papers found.
