• Corpus ID: 208512883

# Minimization of Weighted Completion Times in Path-based Coflow Scheduling

@article{Eckl2019MinimizationOW,
title={Minimization of Weighted Completion Times in Path-based Coflow Scheduling},
author={Alexander Eckl and Luisa Peter and Maximilian Schiffer and Susanne Albers},
journal={ArXiv},
year={2019},
volume={abs/1911.13085}
}
• Published 29 November 2019
• Computer Science
• ArXiv
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…
1 Citations

## Figures and Tables from this paper

Technical Report Column
This report presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of manually cataloging and cataloging all the components of a smart phone.

## References

SHOWING 1-10 OF 23 REFERENCES
Near Optimal Coflow Scheduling in Networks
• Computer Science
SPAA
• 2019
This work studies a slightly different model of coflow scheduling in general graphs and develops practical and efficient approximation algorithms for it, and develops a randomized 2 approximation algorithm for the single path and free path model.
Asymptotically Optimal Approximation Algorithms for Coflow Scheduling
• Computer Science
SPAA
• 2017
This paper develops a general framework for coflow schedules, based on interval-indexed linear programs, which may extend to other coflow models and objective functions and may also yield improved approximation bounds for specific network scenarios.
A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time
• Computer Science
ArXiv
• 2017
The key idea of the approach is to construct a continuous-time schedule using a configuration linear program and interpret each job's completion time therein as the job's deadline, which allows the problem to be reduced to a deadline-constrained scheduling problem.
Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks
• Computer Science
SPAA
• 2015
The main result is the first polynomial-time deterministic approximation algorithm for this problem, with an approximation ratio of 67/3, and a randomized version of the algorithm, with a ratio of 9+16√2/3.
Coflow Scheduling in Data Centers: Routing and Bandwidth Allocation
• Computer Science
IEEE Transactions on Parallel and Distributed Systems
• 2021
This article forms the problem of scheduling a single coflow as a Non-linear Mixed Integer Programming problem and presents its relaxed convex optimization problem and proposes two algorithms, CoRBA and its simplified version: CoR BA-fast that solve the single co flow scheduling problem with a joint consideration of routing and bandwidth allocation.
An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters
• Computer Science
IEEE/ACM Transactions on Networking
• 2018
This paper considers the problem of efficiently scheduling coflows with release dates in a shared datacenter network so as to minimize the total weighted completion time of coflows and proposes a polynomial-time deterministic algorithm that improves the prior known results.
Efficient coflow scheduling with Varys
• Computer Science
• 2014
This paper presents Varys, a system that enables data-intensive frameworks to use coflows and the proposed algorithms while maintaining high network utilization and guaranteeing starvation freedom, and outperforms non-preemptive coflow schedulers by more than 5X.
Rapier: Integrating routing and scheduling for coflow-aware data center networks
• Computer Science
2015 IEEE Conference on Computer Communications (INFOCOM)
• 2015
This work presents Rapier, a coflow-aware network optimization framework that seamlessly integrates routing and scheduling for better application performance, and demonstrates that Rapier significantly reduces the average coflow completion time.
Order Scheduling Models: Hardness and Algorithms