Coflow Scheduling with Performance Guarantees for Data Center Applications
Authors:
- 1 May 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 850-856
Abstract
Data-parallel applications run on cluster of servers in a datacenter and their communication triggers correlated resource demand on multiple links that can be abstracted as coflow. They often desire predictable network performance, which can be passed to network via coflow abstraction for application-aware network scheduling. In this paper, we propose a heuristic and an optimization algorithm for predictable network performance such that they guarantee coflows completion within their deadlines. The algorithms also ensure high network utilization, i.e., it’s work-conserving, and avoids starvation of coflows. We evaluate both algorithms via trace-driven simulation and show that they admit 1.1× more coflows than the Varys scheme while meeting their deadlines.Keywords
This publication has 21 references indexed in Scilit:
- An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in DatacentersIEEE/ACM Transactions on Networking, 2018
- Shaping Deadline Coflows to Accelerate Non-Deadline Coflows2018
- Chronos: Meeting coflow deadlines in data center networks2016
- Rapier: Integrating routing and scheduling for coflow-aware data center networks2015
- Better never than late2011
- Data center TCP (DCTCP)2010
- PortLand2009
- VL22009
- MapReduceCommunications of the ACM, 2008
- Achieving 100% throughput in an input-queued switchIEEE Transactions on Communications, 1999