A Dynamic Load Balancing Algorithm in Computational Grid Using Fair Scheduling
Grid Computing has emerged as an important new field focusing on resource sharing. One of the most challenging issues in Grid Computing is efficient scheduling of tasks. In this paper, we propose a Load balancing algorithm for fair scheduling, and we compare it to other scheduling schemes such as the Earliest Deadline First, Simple Fair Task order, Adjusted Fair Task Order and Max Min Fair Scheduling for a computational grid. It addresses the fairness issues by using mean waiting time. It scheduled the task by using fair completion time and rescheduled by using mean waiting time of each task to obtain load balance. This algorithm scheme tries to provide optimal solution so that it reduces the execution time and expected price for the execution of all the jobs in the grid system is minimized. The performance of the proposed algorithm compared with other algorithm by using simulation.
Keywords: Computational Grid, Scheduling, Load balancing, Fair scheduling, Mean Waiting Time, Execution Cost
Download Full-Text
ABOUT THE AUTHOR
U.Karthick Kumar
He is a Post Graduate with M.Phil from Bharathiar University, Coimbatore.Now, he is working as a Assistant Professor in VLB Janaki Ammal Arts and Science College, Coimbatore. He has three years of experience in research. He presented paper in International Conference. His Interest areas are Grid Computing, Mobile Computing and Data Structures.
U.Karthick Kumar
He is a Post Graduate with M.Phil from Bharathiar University, Coimbatore.Now, he is working as a Assistant Professor in VLB Janaki Ammal Arts and Science College, Coimbatore. He has three years of experience in research. He presented paper in International Conference. His Interest areas are Grid Computing, Mobile Computing and Data Structures.
