Computer and Modernization

Previous Articles     Next Articles

 An Elasticity and Deadline-aware Job Scheduling Algorithm

  

  1. (School of Computer Science and Software Engineering, Tianjin Polytechnic University, Tianjin 300387, China)
  • Received:2018-09-29 Online:2019-04-26 Published:2019-04-30

Abstract: We make an in-depth study of big data analysis jobs using the MapReduce model, and analyze the defects of the existing job scheduling algorithms. Most of the existing algorithms do not take into account these problems: the impact of resource allocation on job deadline and deadline sensitivity for different types of jobs. It is elastic jobs because the completion time of it that varies with the allocation of resource, deadline sensitivity means that different types of jobs have various degrees of strictness to deadlines. To solve above problems, we propose a flexible job scheduling algorithm based on deadline-aware(DA). The algorithm classifies jobs according to the sensitivity of deadline, based on the prediction of the overall execution time of jobs, by regulating different resource allocation strategies to change the completion time, combines with the users’ demand of deadline and the benefits of job pre-execution to planning the resource allocation and scheduling order of jobs in advance, for the sake of maximizing the overall benefits. We implement DA according to simulation experiment, and evaluate it on a 210 machine cluster using production workloads. The experiment shows that the algorithm satisfies the deadline and the overall yield increases by 2.37 times in average.

Key words: flexible job, deadline-aware, execution time prediction, scheduler algorithm

CLC Number: