QoS-constrainted And Grouping Algorithm For Grid Task Scheduling And Simulation In GridSim

Compared with the tradional parallel systems, the grid is a shared enterprising environment where is no central control.So some newer challenges have arisen in the task scheduling.The main goal of grid task scheduling is to maximum its system throughput and to match the application's needs with the available computing resources.In addition, the matching of task with resources in a shared heterogeneous environment leads to concerns with Quality of Service(QoS).In the present, research on task scheduling algorithm for grid is at the beginning stage, it is difficult to propose a systematic scheduling solution to a heterogeneous, dynamic, scalable and large-scale grid.Moreover, centralized resources management has a serious effect on flexibility and fault-tolerance of task scheduling system.This thesis proposes a network bandwidth constraint-based algorithm for grid task scheduling.This new algorighm is based on the grouping scheduling.lt makes a very significant modification that the jobs requiring high bandwidth are given higher priority.As a result, this measure prevents such thing happening, in which the jobs requiring high bandwidth have to wait for hosts occupied, which have been occupied by the jobs only requiring low bandwidth.This modification improves the throughput.It has been demonstrated by a lot of experiments which were done in grid simulator GridSim. In addition to grid task scheduling, some related topic, such as grid computing, task scheduling principle and architecture, basic scheduling service and the design of typical scheduling are involved.This study is just a beginning to support QoS in grid task scheduling.Many issues remain open.How to embed multi-dimensional QoS into task scheduling? How to classify general QoS in a grid environment, and how to choose scheduling frequency? How to adapt the algorithm to grid? There are still more works to do.