LOAD BALANCING NON-PREEMPTIVE JOBS IN GRID ENVIRONMENT

Abstract

The computing resources are effectively utilized in Grid computing by using the concept of scheduling and load balancing. The non- preemptive jobs arrive at random intervalsunder varying load conditions consists of multiple interdependent tasks and independent tasks which will be executed in multiple nodes and have to be assigned to the most appropriate node during the initial placement itself. Algorithms existing in the literature considered only the processing capacity of nodes in the Grid for assigning the incoming jobs. However, the performance of the Grid system can be further improved in terms of response time by considering the length or the execution time of the jobs. In this paper, the load balancing algorithm which considers both the processing capability of the nodes and job length has been proposed for scheduling jobs to the appropriate node.