Real Time System Scheduling Algorithms & Fault Tolerance

Abstract: The main objective of this paper is to implement the real time scheduling algorithms and to minimize the average waiting time so that given set of tasks may be completed in a minimal time with an efficient output. We will also discuss the advantages and disadvantages of the same. Task within the real time system are designed to accomplish certain service(s) upon execution, and thus, each task has a particular significance to overall functionality of the system. Scheduling algorithms in non real time system not considering any type of dead line but in real time system deadline is main criteria for scheduling the task.

Keywords: CPU Scheduling, FCFS, Non Preemptive, Preemptive, Round Robin, Round Robin with SRTF, SJF.