Fault Tolerance and Energy Minimization in Improved Earliest Deadline First Algorithm

Embedded systems are playing a vital role in day-to-day life of every individual. All embedded systems should be properly scheduled for best performance. Scheduling algorithms in such systems play a vital role. There are several scheduling algorithms used for the proper scheduling of tasks that the embedded system should perform. One such scheduling algorithm is the Earliest Deadline First algorithm (EDF) and the improved version of the algorithm is Improved Earliest First Algorithm (IEDF). IEDF makes sure that all high-priority tasks are executed meeting their respective deadlines. In the first part of the paper IEDF implementation and analysis is performed. In the later part, as an innovative contribution fault tolerance and energy minimization in the IEDF algorithm is being achieved using techniques like rollback recovery by placing checkpoints