Research and apply schedule algorithms to grid computing environments

Thanks to advances in wide-area network technologies and the low cost of computing resources, Grid computing came into being and is currently an active research area. One motivation of Grid computing is to aggregate the power of widely distributed resources, and provide non-trivial services to users. To achieve this goal, an efficient Grid scheduling system is an essential part of the Grid. This paper refers to the scheduling problem of grid system and some of scheduling algorithms applied to grid computing model so may reduce the maximum system time needed to complete the application. The algorithms are: OBL, MCT, Min-Min, Max-Min, Sufferage and in this paper is to compare the results of efficiency between algorithms when the applied to specific models.