Abstract :
Due to the emergence of grid computing, which has linked up all the various resources widely distributed (eg: computing resources, storage resources, software resources, information resources, etc.) through the Internet, grid scheduling has become a new focus on grid research. However, a suitable and efficient scheduling algorithm is also badly needed during scheduling process to serve as allocating distributed resources to jobs of different users reasonably. In this paper, we present a new scheduling algorithm based on application demand, through which, can we make most users satisfied by guaranteeing their submitted jobs to be completed within their expected completion times without sacrificing system utilization more. This is the novelty of our algorithm, and it is beneficial for job scheduling and resource sharing in heterogeneous environment.
Keywords :
grid computing; scheduling; application demand aware scheduling algorithm; grid computing; heterogeneous environment; job scheduling; resource sharing; Algorithm design and analysis; Application software; Availability; Collaborative work; Distributed computing; Grid computing; Processor scheduling; Resource management; Scheduling algorithm; System performance; CSCW; Grid computing; Scheduling;