Phoenix: A Constraint-Aware Scheduler for Heterogeneous Datacenters
Authors:
- Prashanth ThinakaranPTPrashanth Thinakaran
- Jashwant Raj GunasekaranJGJashwant Raj Gunasekaran
- Bikash SharmaBSBikash Sharma
- Mahmut Taylan KandemirMKMahmut Taylan Kandemir
- Chita R. DasCDChita R. Das
- 1 June 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636927,p. 977-987
Abstract
Today's datacenters are increasingly becoming diverse with respect to both hardware and software architectures in order to support a myriad of applications. These applications are also heterogeneous in terms of job response times and resource requirements (eg., Number of Cores, GPUs, Network Speed) and they are expressed as task constraints. Constraints are used for ensuring task performance guarantees/Quality of Service(QoS) by enabling the application to express its specific resource requirements. While several schedulers have recently been proposed that aim to improve overall application and system performance, few of these schedulers consider resource constraints across tasks while making the scheduling decisions. Furthermore, latencycritical workloads and short-lived jobs that typically constitute about 90% of the total jobs in a datacenter have strict QoS requirements, which can be ensured by minimizing the tail latency through effective scheduling. In this paper, we propose Phoenix, a constraint-aware hybrid scheduler to address both these problems (constraint awareness and ensuring low tail latency) by minimizing the job response times at constrained workers. We use a novel Constraint Resource Vector (CRV) based scheduling, which in turn facilitates reordering of the jobs in a queue to minimize tail latency. We have used the publicly available Google traces to analyze their constraint characteristics and have embedded these constraints in Cloudera and Yahoo cluster traces for studying the impact of traces on system performance. Experiments with Google, Cloudera and Yahoo cluster traces across 15,000 worker node cluster shows that Phoenix improves the 99th percentile job response times on an average by 1.9× across all three traces when compared against a state-of-the-art hybrid scheduler. Further, in comparison to other distributed scheduler like Hawk, it improves the 90 th and 99 th percentile job response times by 4.5× and 5× respectively.Keywords
This publication has 23 references indexed in Scilit:
- VIP2015
- Containers and Cloud: From LXC to Docker to KubernetesIEEE Cloud Computing, 2014
- A reconfigurable fabric for accelerating large-scale datacenter services2014
- Apache Hadoop YARN2013
- Omega2013
- alsched2012
- Interactive analytical processing in big data systemsProceedings of the VLDB Endowment, 2012
- Modeling and synthesizing task placement constraints in Google compute clusters2011
- Delay scheduling2010
- Towards characterizing cloud backend workloadsACM SIGMETRICS Performance Evaluation Review, 2010