Minimization of Weighted Completion Times in Path-based Coflow Scheduling

11/29/2019
by   Alexander Eckl, et al.
0

Coflow scheduling models communication requests in parallel computing frameworks where multiple data flows between shared resources need to be completed before computation can continue. In this paper, we introduce Path-based Coflow Scheduling, a generalized problem variant that considers coflows as collections of flows along fixed paths on general network topologies with node capacity restrictions. For this problem, we minimize the coflows' total weighted completion time. We show that flows on paths in the original network can be interpreted as hyperedges in a hypergraph and transform the path-based scheduling problem into an edge scheduling problem on this hypergraph. We present a (2λ + 1)-approximation algorithm when node capacities are set to one, where λ is the maximum number of nodes in a path. For the special case of simultaneous release times for all flows, our result improves to a (2λ)-approximation. Furthermore, we generalize the result to arbitrary node constraints and obtain a (2λΔ + 1)- and a (2λΔ)-approximation in the case of general and zero release times, where Δ captures the capacity disparity between nodes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/06/2022

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

Coflow is a recently proposed network abstraction to capture communicati...
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
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
03/30/2023

Weighted Scheduling of Time-Sensitive Coflows

Datacenter networks routinely support the data transfers of distributed ...
research
05/19/2020

Scheduling Flows on a Switch to Optimize Response Times

We study the scheduling of flows on a switch with the goal of optimizing...
research
05/02/2022

DCoflow: Deadline-Aware Scheduling Algorithm for Coflows in Datacenter Networks

Datacenter networks routinely support the data transfers of distributed ...
research
10/15/2020

Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters

Reconfigurable optical topologies are emerging as a promising technology...

Please sign up or login with your details

Forgot password? Click here to reset