GRID COMPUTING ALGORITHM USING PRIORITY SCHEDULER
Grid Computing has evolved as a vital field focusing on sharing of resources. Efficient scheduling of tasks is most challenging issues in Grid Computing. Load Balancing is a technique to improve utilization of resources increasing throughput managing, parallelism and to reduce the time taken for response through proper distribution of the jobs. Generally there are three type of phases related to Load balancing i.e. Information Collection, Decision Making, Data Migration. Through this paper, we are proposing a Load balancing algorithm for optimal scheduling. It schedules the task by reducing completion time and by rescheduling waiting time of each job to obtain load balance. This algorithm works on providing optimal solution so that it minimizes the execution time and expected price for the execution of all the jobs in the grid system. Load balancing algorithms are basically of two types, static and dynamic. Our algorithms in this paper based on dynamic nature load balancing. Keywords—Execution Cost, Resource Monitoring, Computational Grid, Load balancing, and Priority scheduler. ELB: Enhanced Load Balancing