• retagged by
913 views
0 0 votes

] Our CPU is currently idle and the current time is labeled time 0. Four processes arrive to the ready queue at the following times and with the following required run time: 

See image for Ariival time and Process info

Simulate the process scheduling and execution under the FCFS, SJF, and SRTN scheduling algorithms. Indicate each scheduling decision, and calculate the turnaround time for each process. Also calculate the average turnaround time for each scheduling algorithm.

2 Answers

0 0 votes
Av. TAT for FCFS= 32.75

Av. TAT for SJF=20.25

Av. TAT for SRTN=15.75
Position:
Show:

Related questions

1 1 vote
2 2 answers
2.0k
2.0k views
legacy asked Nov 26, 2022
1,976 views
Suppose that a machine has 42-bit virtual addresses and 32-bit physical addresses.{a} How much RAM can the machine support (each byte of RAM must be addressable)?{b} What...
1 1 vote
1 1 answer
2.0k
2.0k views
atulcse asked Nov 4, 2021
1,992 views
Does FCFS suffer from starvation?
–1 –1 vote
0 0 answers
374
374 views
rahul sharma 5 asked Dec 6, 2016
374 views
Consider the following program:-int a=5;printf(&a);//print address of aint b=malloc();printf(&b); //print address of bWill it print logical address in both cases?If yes,t...
1 1 vote
0 0 answers
1.8k
1.8k views
RahulRoy31 asked Oct 29, 2018
1,773 views
Consider the following process scheduling data:Process Arrival Time Processing TimeA 0.000 3B 1.001 ...