On Scheduling Coflows - (Extended Abstract)

Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang

Abstract: Applications designed for data-parallel computation frameworks such as MapReduce usually alternate between computation and communication stages. Coflow scheduling is a recent popular networking abstraction introduced to capture such application-level communication patterns in datacenters. In this framework, a datacenter is modeled as a single non-blocking switch with m input ports and m output ports. A coflow j is a collection of flow demands \(\{d^j_{io}\}_{i \in m, o \in m}\) that is said to be complete once all of its requisite flows have been scheduled.