Network-Aware Scheduling for Data-Parallel Jobs

To reduce the impact of network congestion on big data jobs, cluster management frameworks use various heuristics to schedule compute tasks and/or network flows. Most of these schedulers consider the job input data fixed and greed-ily schedule the tasks and flows that are ready to run. How-ever, a large fraction of production jobs are recurring with predictable characteristics, which allows us to plan ahead for them. Coordinating the placement of data and tasks of these jobs allows for significantly improving their network local-ity and freeing up bandwidth, which can be used by other jobs running on the cluster. With this intuition, we develop Corral, a scheduling framework that uses characteristics of future workloads to determine an offline schedule which (i) jointly places data and compute to achieve better data local-ity, and (ii) isolates jobs both spatially (by scheduling them in different parts of the cluster) and temporally, improving their performance. We implement Corral on Apache Yarn, and evaluate it on a 210 machine cluster using production workloads. Compared to Yarn’s capacity scheduler, Corral reduces the makespan of these workloads up to 33 % and the median completion time up to 56%, with 20-90 % reduction in data transferred across racks. CCS Concepts •Networks→Data center networks; •Computer systems organization → Cloud computing