CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Scheduling Criteria & Process Times

Consider the ...

Question

Consider the following table of arrival time and burst time for three processes P0, P1 and P2

Process Arrival time Burst time

P0 0 ms 9 ms

P1 1 ms 4 ms

P2 2 ms 9 ms

The pre-emptive shortest job first scheduling alogrithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for th three processes?

A

6.33 ms

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

7.33 ms

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

4.33 ms

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

5.0 ms

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Open in App

Solution

The correct option is D 5.0 ms

Average waitin time
$= \frac{w_{1} + w_{2} + w_{3}}{3} = \frac{(5 - 1) + 0 + (13 - 2)}{3}$
= 5.0 ms

Suggest Corrections

thumbs-up

3

Similar questions

Q. An operating system uses Shortest Remaining Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes.

Process	Execution time	Arrival time
P1 P2 P3 P4	20 25 10 15	0 15 30 45

What is the total waiting time for process P2?

Q.
Consider the following set of processes, with the arrival times and the CPU-burst times given in milliseconds

Process	Arrival time	Burst time
P1 P2 P3 P4	0 1 2 4	5 3 3 1

What is the average turnaround time for these processes with the preemptive Shortest Remaining Processing Time first (SRPT) algorithm?

Q. The arrival time, priority, and durations of the CPU and I/O bursts for each of three processes

P_{1}

P_{2}

P_{3}

are given in the table below. Each process has a CPU burst followed by ab I/O burst followed by another CPU burst. Assume that each prcess has its own I/O resource.

Process	Arrival time	Priority	Burst durations CPU, I/O CPU
$P_{1}$	0	2	1,5,3
$P_{2}$	2	3 (lowest)	3,3,1
$P_{3}$	3	1 (highest)	2,3,1

The multi-programmed operating system uses preemptive priority scheduling. What are the finish times of the processes

P_{1}

P_{2}

P_{3}

Q. Consider three processes (process id 0, 1, 2, respectively) with compute time bursts 2, 4, and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowerst process id. The average turn around time is

Q. Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time.

Process	Arrival Time	Burst Time	Priority
$P_{1}$	0	11	2
$P_{2}$	5	28	0
$P_{3}$	12	2	3
$P_{4}$	9	10	1
$P_{5}$	9	16	4

The average waiting time (in milliseconds) of all the processes using preemptive priority sccheduling algorithm is _____.

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Scheduling Criteria & Process Times

OTHER

Watch in App

explore_more_icon

Explore more

Scheduling Criteria & Process Times

Join BYJU'S Learning Program

CrossIcon