Real time scheduling is of two types: Soft Real-Time scheduling which does not guarantee when when a critical real-time process will be scheduled; Hard Real-Time scheduling in which the process must be scheduled before the deadline. In this post we will cover two real time scheduling algorithms: rate monotonic scheduling and earliest deadline first. Points […]
The most commonly used CPU scheduling algorithms are First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR) and Priority
The goal of the multi-programming system is to keep the CPU busy at all times. In a uni-processor system whenever the CPU becomes idle it is allocated to a new process. Which process will be allocated the CPU is decided by the short-term scheduler. CPU scheduling means to select the next process to be allocated […]