A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Network-Aware Scheduling for Data-Parallel Jobs
2015
Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication - SIGCOMM '15
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 greedily schedule the tasks and flows that are ready to run. However, 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
doi:10.1145/2785956.2787488
dblp:conf/sigcomm/JalapartiBMRMC15
fatcat:zbmqeuphxfgwlbx2l2ednurnpm