earticle

영어

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 active research topics in grid environments. The goal of grid task scheduling is to achieve high system throughput and to allocate various computing resources to applications. The Complexity of scheduling problem increases with the size of the grid and becomes highly difficult to solve effectively. Many different methods have been proposed to solve this problem. Some of these methods are based on heuristic techniques that provide an optimal or near optimal solution for large grids. In this paper, a new heuristic algorithm for scheduling meta-tasks in grid computing system is presented which tries to consider the execution time and machine state simultaneously by a mapping function. According to the experimental results, the proposed algorithm confidently demonstrates its competitiveness with previously proposed algorithms.