Scheduling Coflows for Minimizing the Maximum Completion Time in Heterogeneous Parallel Networks
Chi-Yeh Chen

TL;DR
This paper presents a polynomial-time approximation algorithm for coflow scheduling in heterogeneous parallel networks, aiming to minimize maximum completion time with proven guarantees across various switch architectures.
Contribution
It introduces a novel approximation algorithm tailored for different switch architectures in heterogeneous networks, addressing the NP-hard coflow scheduling problem.
Findings
Achieves an approximation guarantee of min{τ, 2Nm+1} for EPS switches.
Guarantees a 2-approximation in environments with not-all-stop OCS.
Provides a 2τ+2 approximation for all-stop OCS setups.
Abstract
Coflow is a prominent network abstraction for modeling communication patterns in data centers. Since coflow scheduling in large-scale data centers is -hard, this paper investigates this problem within heterogeneous parallel networks featuring multiple network cores. We propose a polynomial-time approximation algorithm to minimize the makespan (maximum completion time). We consider three distinct switch architectures: Electronic Packet Switches (EPS), not-all-stop Optical Circuit Switches (OCS), and all-stop OCS. Under a deployment where all switches are EPS, the proposed algorithm achieves an approximation guarantee of , which reduces to when where is the maximum number of flows of each port of switch, is the number of input/output ports and is the number of network cores. In environments entirely composed of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed and Parallel Computing Systems · Interconnection Networks and Systems · Scheduling and Optimization Algorithms
