원문정보
보안공학연구지원센터(IJGDC)
International Journal of Grid and Distributed Computing
Vol.4 No.3
2011.09
pp.25-36
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보