GATE - 2014 | OS | An operating system uses shortest remaining time first scheduling

GATE - 2014 | OS | An operating system uses shortest remaining time first scheduling
Posted on 11-02-2022

GATE - 2014 [Operating System]

Question:

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds): 

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with

The average waiting time (in milliseconds) of the processes is

 

A

5.5

B

5.6

C

5.7

D

5.8

 

Solution:

Option (A) is Correct.      

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with
WT - Waiting Time
CT - Completion Time
TAT - Turn Around Time
TAT = CT - AT < br> WT = TAT - BT
Gantt chart using Shortest remaining time first,
An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with
Avg. WT = 15+0+3+4/4 = 22/4 = 5.5

Thank You

Download App for Free PDF Download

GovtVacancy.Net Android App: Download

government vacancy govt job sarkari naukri android application google play store https://play.google.com/store/apps/details?id=xyz.appmaker.juptmh