A survey of job scheduling in grids

  • Authors:
  • Congfeng Jiang;Cheng Wang;Xiaohu Liu;Yinghui Zhao

  • Affiliations:
  • Engineering Computing and Simulation Institute, Huazhong University of Science and Technology, Wuhan, China;Engineering Computing and Simulation Institute, Huazhong University of Science and Technology, Wuhan, China;Engineering Computing and Simulation Institute, Huazhong University of Science and Technology, Wuhan, China;Engineering Computing and Simulation Institute, Huazhong University of Science and Technology, Wuhan, China

  • Venue:
  • APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of optimally scheduling tasks onto heterogeneous resources in grids, minimizing the makespan of these tasks, has proved to be NP-complete. There is no best scheduling algorithm for all grid computing systems. An alternative is to select an appropriate scheduling algorithm to use in a given grid environment because of the characteristics of the tasks, machines and network connectivity. In this paper a survey is presented on the problem and the different aspects of job scheduling in grids such as (a) fault-tolerance; (b) security; and (c) simulation of grid job scheduling strategies are discussed. This paper also presents a discussion on the future research topics and the challenges of job scheduling in grids.