earticle

논문검색

Job Scheduling Algorithms on Grid Computing: State-of- the Art

초록

영어

Scheduling jobs on computational grids is identified as NP-complete problem due to the heterogeneity of resources; the resources belong to different administrative domains and apply different management policies. This paper conducted an extensive and wide literature review to study the state of the art of grid scheduling algorithms. This review starts with an overview of the grid technologies and a description of the grid resource management systems. The evolution of the grid scheduling mechanisms is illustrated in this paper started from basic scheduling mechanisms such as Min-Min and Max-Min approaches ending with the swarm intelligence optimization methods. The swarm intelligence and evolutionary mechanisms are also presented and critically analyzed.

목차

Abstract
 1. Introduction
 2. Job Scheduling Process
 3. Scheduling Methods for Computational Grid: State-of- the Art
  3.1 Heuristics and Greedy Algorithms
  3.2.Hill Climbing (HC)
  3.3 Evolutionary Algorithms
  3.4 Swarm Intelligence
 4. Conclusion
 References

저자정보

  • Adil Yousif University Science & Technology-Sudan
  • Sulaiman Mohd Nor Universiti Teknologi Malaysia
  • Mohammed Bakri Bashir Shendi University-Sudan

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.