返回
Scheduling Coflows With Dependency Graph
DOI:10.1109/TNET.2021.3116133.png)
摘要
En 中文
Applications in data-parallel computing typically consist of multiple stages. In each stage, a set of intermediate parallel data flows (Coflow) is produced and transferred between servers to enable starting of next stage. While there has been much research on scheduling isolated coflows, the dependency between coflows in multi-stage jobs has been largely ignored. In this paper, we consider scheduling coflows of multi-stage jobs represented by general DAGs (Directed Acyclic Graphs) in a shared data center network, so as to minimize the total weighted completion time of jobs. This problem is significantly more challenging than the traditional coflow scheduling, as scheduling even a single multi-stage job to minimize its completion time is shown to be NP-hard. In this paper, we propose a polynomial-time algorithm with approximation ratio of O(mu log(m)/log(log(m))), where mu is the maximum number of coflows in a job and m is the number of servers. For the special case that the jobs' underlying dependency graphs are rooted trees, we modify the algorithm and improve its approximation ratio. To verify the performance of our algorithms, we present simulation results using real traffic traces that show up to 53 % improvement over the prior approach. We conclude the paper by providing a result concerning an optimality gap for scheduling coflows with general DAGs.
Keyword:
Servers
Approximation algorithms
Schedules
Data centers
Switches
Job shop scheduling
Task analysis
Multi-stage job
coflow
scheduling algorithms
approximation algorithms
data centers
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
Electrostatic Free Energy and Other Properties of States Having Nonequilibrium Polarization. I具有非平衡极化状态的静电自由能和其他性质。我
Preservative Effect of Ginger Root (Zingiber officinale R.) Extract in Refined Palm Olein Subjected to Accelerated Thermal Oxidation生姜根(Zingiber officinale R.)提取物对经加速热氧化的精炼棕榈油清的防腐效果

