arrow
Return

Optimistic scheduling with service guarantees

delete2020-01-01
delete3
PRE
AI
K
Karthik Kambatla *
V
Vamsee Yarlagadda
Í
Íñigo Goiri
A
Ananth Grama
DOI:10.1016/j.jpdc.2019.04.010delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Data centers form the core of current information and commercial enterprise. At current scale, any improvement in data center resource utilization leads to substantial savings. We focus on the problem of scheduling jobs in distributed execution environments to improve resource utilization. Cluster schedulers like YARN and Mesos base their scheduling decisions on resource requirements provided by end users. It is hard for end-users to predict the exact amount of resources required for a task/job, especially since resource utilization can vary significantly over time and across tasks. In practice, users make highly conservative estimates of peak utilization across all tasks of a job to ensure job completion, leading to resource fragmentation and severe under utilization in production clusters. We present UBIS, a utilization-aware approach to cluster scheduling, to address resource fragmentation, and to improve cluster utilization and job throughput. UBIS considers actual usage of running tasks and schedules opportunistic work on under-utilized nodes. UBIS monitors resource usage on these nodes and preempts opportunistic containers in the event this over-subscription becomes untenable. In doing so, UBIS effectively utilizes wasted resources, while minimizing adverse effects on regularly scheduled tasks. Our implementation of UBIS on YARN demonstrates improvements of up to 30% in makespan for a representative workload and 25% in individual job durations. (C) 2019 Elsevier Inc. All rights reserved.
Keywords:
Cluster scheduling
Distributed computing
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Journal of Parallel and Distributed Computing cover
Journal of Parallel and Distributed Computing
IF:
4
Papers:
3.8K
Citations:
4.8K

Organization

F
facebook inc
Scholars:
588
Papers: 381
Citations: 0
Purdue University System cover
Purdue University System
Scholars:
3.9W
Papers: 3.6W
Citations: 66
P
Purdue University
Scholars:
2.7W
Papers: 2.1W
Citations: 147
M
Microsoft
Scholars:
3.0K
Papers: 2.7K
Citations: 7
researcher View more organizations