Fault Tolerant Instantaneous Utilization Factor Schedulability of Real Time Tasks

Abstract.This paper put forwards review on single processor scheduling algorithm to arrange periodic tasks for soft real time system. The characteristics of the off-line scheduler are that on the basis of rate monotonic algorithm, tasks are scheduled and accomplishment is done on the basis of Instantaneous Utilization Factor (IUF) scheduling algorithm. The tolerances of max f faults which can occur at any point of time equal to the largest relative dead line of the task set are considered in it. The likelihood of completion of the task set is checked based on the maximum workload requested by the higher priority jobs within the released time and deadline of the job of each task that is released at that instant. It provides a possible copy titled recovery copy to be executed if any fault occurs in the system to save the time. Tasks are alienated in to number of sub tasks and are executed distinctly which benefits the execution time by saving it and workload to be executed for the recovery copy