Scheduling Coflows for Minimizing the Total Weighted Completion Time in Identical Parallel Networks

04/06/2022
by   Chi-Yeh Chen, et al.
0

Coflow is a recently proposed network abstraction to capture communication patterns in data centers. The coflow scheduling problem in large data centers is one of the most important NP-hard problems. Previous research on coflow scheduling focused mainly on the single-switch model. However, with recent technological developments, this single-core model is no longer sufficient. This paper considers the coflow scheduling problem in identical parallel networks. The identical parallel network is an architecture based on multiple network cores running in parallel. Coflow can be considered as divisible or indivisible. Different flows in a divisible coflow can be transmitted through different network cores. Considering the divisible coflow scheduling problem, we propose a (6-2/m)-approximation algorithm with arbitrary release times, and a (5-2/m)-approximation without release time, where m is the number of network cores. On the other hand, when coflow is indivisible, we propose a (7-2/m)-approximation algorithm with arbitrary release times, and a (6-2/m)-approximation without release time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2022

Scheduling Coflows for Minimizing the Total Weighted Completion Time in Heterogeneous Parallel Networks

Coflow is a network abstraction used to represent communication patterns...
research
06/04/2023

Efficient Approximation Algorithms for Scheduling Coflows with Total Weighted Completion Time in Identical Parallel Networks

This paper addresses the scheduling problem of coflows in identical para...
research
05/05/2022

Scheduling Coflows with Precedence Constraints for Minimizing the Total Weighted Completion Time in Identical Parallel Networks

Coflow is a recently proposed network abstraction for data-parallel comp...
research
02/14/2023

Scheduling Coflows for Minimizing the Makespan in Identical Parallel Networks

With the development of technology, parallel computing applications have...
research
11/29/2019

Minimization of Weighted Completion Times in Path-based Coflow Scheduling

Coflow scheduling models communication requests in parallel computing fr...
research
06/17/2019

Near Optimal Coflow Scheduling in Networks

The coflow scheduling problem has emerged as a popular abstraction in th...

Please sign up or login with your details

Forgot password? Click here to reset