A Balanced Scheduling Algorithm with Fault Tolerant and Task Migration based on Primary Static Mapping (PSM) in Grid
In this paper we present a balanced scheduling algorithm with considering the fault tolerance and task migration of allocating independent tasks in grid systems. Resource scheduling and its management are great challenges in heterogeneous environment. Hence load balancing is one of the best solutions to achieve the above purposes. The scheduling algorithm which we will present in follow, with taking the fault tolerance, checkpointing method, task migration and priority for mapping independent tasks on heterogeneous computing environment, creates the specific situation to ensure high performance in grid systems. So by implementing these parameters we can achieve more efficient and dependable performance than similar previous algorithms. It will be done with better condition and achieve high performance in computational grids in compare with Min-min algorithm. Finally the experiment and simulated results show that proposed balanced scheduling algorithm performs significantly to ensure high throughput, reduced makespan, reliability and more efficiency in the grid environment.