Oh Han Kang , Sang Seong Kang , Jin Suk Kim

The KIPS Transactions:PartA, Vol. 14, No. 2, pp. 99-106, Apr. 2007
10.3745/KIPSTA.2007.14.2.99,   PDF Download:

Abstract

Grid computing, a mechanism which uses heterogeneous systems that are geographically distributed, draws attention as a new paradigm for the next-generation operation of parallel and distributed computing. The importance of grid computing concerning communication cost is very huge because grid computing furnishes users with integrated virtual computing service, in which a number of computer systems are connected by a high-speed network. Therefore, to reduce the execution time, the scheduling algorithm in grid environment should take communication cost into consideration as well as computing ability of resources. However, most scheduling algorithms have not only ignored the communication cost by assuming that all tasks were dealt in one cluster, but also did not consider the overhead of communication cost when the tasks were processed in a number of clusters. In this paper, the functions of original scheduling algorithms are analyzed. More importantly, the functions of algorithms are compared and analyzed with consideration of communication cost within the co-allocation environment, in which a task is performed separately in many clusters.

Statistics
Cite this article