SRTF GATE 2011 Example If we talk about scheduling algorithm from the GATE point of view, they generally ask simple numerical questions…
Process Management Introduction
-
-
Process Queues The Operating system manages various types of queues for each of the process states. The PCB related to the process…
-
Shortest Remaining Time First (SRTF) Scheduling Algorithm This Algorithm is the preemptive version of SJF scheduling. In SRTF, the execution of the…
-
Process Schedulers Operating system uses various schedulers for the process scheduling described below. 1. Long term scheduler Long term scheduler is also…
-
SRTF with Processes contains CPU and IO Time Till now, we were considering the CPU bound jobs only. However, the process might…
-
Process States State Diagram The process, from its creation to completion, passes through various states. The minimum number of states is five.…
-
SSTF Scheduling Algorithm Shortest seek time first (SSTF) algorithm selects the disk I/O request which requires the least disk arm movement from…
-
Introduction When two or more process cooperates with each other, their order of execution must be preserved otherwise there can be conflicts…
-
Strategies for handling Deadlock 1. Deadlock Ignorance Deadlock Ignorance is the most widely used approach among all the mechanism. This is being…
-
Resource Allocation Graph The resource allocation graph is the pictorial representation of the state of a system. As its name suggests, the…