Research Of Job Scheduling Algorithm In Computational Grid

Grid computing is based on power grid. It organizes distributed computers as a"virtual super computer"by network. Every computer is called a node, and all the nodes form a"Grid". The target of grid is to make the users feel the use of grid is as convenient as using power grid. Grid computing provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities. It provides an ideal platform to solve large-scale computing problems in scientific and engineering area.Job scheduling is a key issue in computational grid. In grid environments, from job submission to result processing, all events about jobs are under the control of job management. Because grid environments are large-scale, heterogeneous, dynamic, distributed and autonomous, grid job management is complex and challenging. Referring current research results on job scheduling algorithms in grid environments, this paper proposes a job scheduling algorithm based on greedy strategy and a self-adaptive algorithm. Our research works mainly include:1.This paper constructs a mathematical model of job scheduling in grid environments. Considering the network delay, improvements are made to the model.2. There is one common characteristic that one job can only be assigned to one node among the representative job scheduling algorithms. Replica exploits the space parallelism and enables various nodes execute the same job. The benefit is that it reduces the makespan at the expense of additional resource consumption. This paper proposes a greedy algorithm based on replica. It adopts different greedy strategy at different phase...