A Dynamic Load Balancing Algorithm in Computational Grid Using Fair Scheduling

Provided by: International Journal of Computer Science Issues
Topic: Big Data
Format: PDF
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, the authors propose a Load balancing algorithm for fair scheduling, and they 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.

Find By Topic