Computer and Modernization

Previous Articles     Next Articles

Deadline Constrained MapReduce Jobs Scheduling for Cloud Computing

  

  1. (1. Jiangsu Hoperun Software Company, Nanjing 210012, China; 2. Institute of Software, Chinese Academy of Sciences, Beijing 100190, China)
  • Received:2018-04-27 Online:2018-11-22 Published:2018-11-23

Abstract: This paper proposes a deadline constrained MapReduce jobs scheduling approach for cloud computing. A weighted bipartite graph is used to model the problem of scheduling MapReduce jobs. Map jobs and reduce jobs are organized as two isolated sets, and the weights of edges connecting two sets represent the executing time to execute jobs. Furthermore, an integral linear programming method is used to solve the problem of matching the bipartite graph with the least weight. The proposed scheduling approach considers heterogeneous servers in cloud computing, where different servers have different task execution time. This paper online predicts and adjusts the deadlines of different tasks, so improves the performance of processing MapReduce jobs significantly. The experimental results demonstrate that the proposed approach reduces the time of accessing data and the jobs which violates the deadline.

Key words: job scheduling, deadline constraint, cloud computing, performance management

CLC Number: