Task Scheduling Algorithm in GRID Considering Heterogeneous Environment

—This papers deals with a new task scheduling algorithm for distributed heterogeneous computing environments. In distributed and parallel computing system, efficient task scheduling of computationally intensive applications is one of the most essential and difficult issues. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous computing systems, and connected via memory, bus, or LAN. But today parallel and distributed system is organized with platform that is heterogeneous. And they are connected via Internet so each platform has different ability of computation performance and different network bandwidth. Therefore we propose improved scheduling strategy considering characters of heterogeneous system.

[1]  Hesham H. Ali,et al.  Task scheduling in parallel and distributed systems , 1994, Prentice Hall series in innovative technology.

[2]  Arnold L. Rosenberg On scheduling collaborative computations on the Internet, I: mesh-DAGs and their close relatives , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[3]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[4]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.