Data processing frameworks such as MapReduce [8] and Dryad [11] are used today in business environments where customers expect guaranteed performance. To date, however, these systems are not capable of providing guarantees on job latency because scheduling policies are based on fairsharing, and operators seek high cluster use through statistical multiplexing and over-subscription. With Jockey, we provide latency SLOs for data parallel jobs written in SCOPE. Jockey precomputes statistics using a simulator that captures the job's complex internal dependencies, accurately and efficiently predicting the remaining run time at different resource allocations and in different stages of the job. Our control policy monitors a job's performance, and dynamically adjusts resource allocation in the shared cluster in order to maximize the job's economic utility while minimizing its impact on the rest of the cluster. In our experiments in Microsoft's production Cosmos clusters, Jockey meets the specified job latency SLOs and responds to changes in cluster conditions.

No abstract

No~vrrrlrrys, with conzputer-supported rrnrrlysis of rlrrtrrbnses, constructing biblionretric or scientonteiric inrlicrrtors nrny be consirlered errsy. Theprobleni is nzore to serify the nccurrrcy of tire globnl anrrlysis, including the sany~ling of drrtrr. The global coherence of rm analysis depends on tlte nrlequrrcy of rrll the steps. Using on-line drrtnbrrses, nn experinlent ~vrrs rlesigned to denwnstrrrte this. Keeping the sang protocol for dnta collec.tion, the srrnte inrlicrrtors rrre user1 oser the ~lrrrious smzples. he resultsfronr three sepnrnfe rlrrtrrbrrses are profounrlly rZi&ferent. I, Quoninm. I l l

No abstract

No abstract