원문정보
초록
영어
Grid computing is a promising technology for future computing platforms and is expected to provide easier access to remote computational resources that are usually locally limited. Scheduling is one of the core steps to efficiently exploit the capabilities of grid computing (GC) systems. The problem of optimally mapping (defined as matching and scheduling) tasks onto the machines of a grid computing environment has been shown, in general, to be NPcomplete, requiring the development of heuristic techniques. The efficient scheduling of independent tasks in a heterogeneous computing environment is an important problem in domains such as grid computing. Different criteria can be used for evaluating the efficiency of scheduling algorithms, the most important of which are makespan, resource utilization and matching proximity. In this paper we will compare 7 popular heuristics for statically mapping independent tasks onto grid computing systems.
목차
1. Introduction
2. Heuristic Descriptions
2.1. OLB
2.2. MCT
2.3. Min-min
2.4. Max-min
2.5. LJFR-SJFR
2.6. Sufferage
2.7. Maxstd
3. Scheduling Problem Definition
4. Performance Evaluation
4.1. Simulation Model
4.2. Makespan
4.3. Resource Utilization
4.4. Matching proximity
5. Conclusions and Future Work
References