An Efficient Model to Minimize Makespan On Data Grids Considering Local Tasks
Scheduling divisible loads on the resources of a grid has gain a great attention in last years. In grids, load scheduling plays a crucial role in achieving high utilization of resources. Many scheduling algorithms assume that grid resources such as CPU power are constant which mean that they are static algorithms. In dynamic, non-dedicated environment such as grids, this assumption is not suitable where in grids, distributed computers (workers) are assumed to process local tasks in addition to grid incoming tasks.