Reduced Communications Fault Tolerant Task Scheduling Algorithm for Multiprocessor Systems
Nabil Tabba, Reza Entezari‐Maleki, Ali Movaghar · Procedia Engineering · 2012
Multiprocessor systems have been widely used for the execution of parallel applications. Task scheduling is crucial for the right operation of multiprocessor systems, where the aim is shortening the length of schedules. Fault tolerance is becoming a necessary attribute in multiprocessor systems as the number of processing elements is getting larger. This paper presents a fault tolerant scheduling algorithm for task graph applications in multiprocessor systems. The algorithm is an extension of a previously proposed algorithm with a reduced communications scheme. Simulation results show the efficiency of the proposed algorithm despite its simplicity.