Simple Scheduling Algorithm with Load Balancing for Grid Computing

Grid computing provides the means of using and sharing heterogeneous resources that are geographically distributed to solve complex scientific or technical problems. Task scheduling is critical to achieving high performance on grid computing environment. The objective of the scheduling process is to map each task with specific requirements to a capable machine in order to minimize the makespan. Task scheduling is shown to be NP-complete problem, which can be solved using heuristic algorithms. Several heuristic algorithms have been proposed in the literature and they are either not efficient or complex. In this paper, we are proposing a Simple Scheduling Algorithm with Load Balancing (SSALB), which minimizes the makespan and balances the load with a low computational complexity.