Earticle

초록

영어

Users and resources frequently join and leave computational grid, hence the state of the grid changes dynamically. So, an effective job scheduling strategy is needed that consider the dynamically changed conditions in the grid. Most of the existing scheduling strategies are mainly based on selecting resources that have less resource response time or less grid bandwidth while these resources may be out of date at the scheduling time. This paper proposes a scheduling strategy with the objective of minimizing the effects of grid dynamism on the grid performance. The strategy schedules jobs to the resources according to status update timing combined with response time of the resources. The proposed strategy is compared with the time-based strategy in terms of the number of jobs executed successfully within the specified deadline and the makespan of user applications. Experimental results have shown that the proposed strategy can considerably improve the performance of the grid.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Problem Formulation
 4. Proposed Job Scheduling Strategy
 5. Simulation Environment
 6. Results
  6.1 The Effect of the Update Time
  6.2 Makespan Comparison
  6.3 The Number of Not Completed Jobs
 7. Conclusions
 References

키워드

저자

• M. Amoon [ Computer Science and Eng. Dept., Faculty of Electronic Eng.,Menofia University, Egypt ]
• H. M. Faheem [ Faculty of Computer and Information Science, Ain Shams University, Egypt ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605