The Scheduling of tasks on heterogeneous grid resources is known to be a NP-complete problem; therefore, to get a near optimal solution within finite duration, heuristics/meta-heuristics are used for task scheduling instead of exact optimization methods. In this paper, we proposed a new heuristic method for scheduling of independent tasks on heterogeneous grid resources and compared the result with ten other scheduling heuristics. Benchmark instances of Expected Time to Complete (ETC) model, suggested by Braun [3] are used to test the proposed heuristic. New heuristics give best Makespan as well as Flow-time values under much prevalent consistent resource and task heterogeneity conditions.
목차
Abstract 1. Introduction 2. Grid Scheduling Problem 2.1. Makespan 2.2 Flow time 3. Heuristics for Grid Scheduling 3.1. Opportunistic Load Balancing (OLB) 3.2. Minimum Execution Time (MET) 3.3. Minimum Completion Time (MCT) 3.4. Switching Algorithm (SA) 3.5. k-Percent Best (kPB) 3.6. Work Queue (WQ) 3.7. Min-min 3.8. Max-min 3.9. LJFR-SJFR 3.10. Suffrage 4. Proposed Heuristics: 5. Test Problem 6. Computational Results 6.1. Computation Program 6.2. Result 7. Conclusion & Future Work References
키워드
Computational GridScheduling Heuristic
저자
Anand K Chaturvedi [ ABV- Indian Institute of Information Technology and Management, Gwalior India ]
Rajendra Sahu [ ABV- Indian Institute of Information Technology and Management, Gwalior India ]
보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Grid and Distributed Computing
간기
격월간
pISSN
2005-4262
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.4 No.3