Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Consider a scheduling simulation involving 20 processes, each running for a total duration of 1000ms spread over separate CPU bursts ranging uniformly in duration from

image text in transcribed

Consider a scheduling simulation involving 20 processes, each running for a total duration of 1000ms spread over separate CPU bursts ranging uniformly in duration from 25ms to 75ms. Context switch time (CST) is 2ms. The following four scheduling policies are used in the simulation (not in order): FCFS RR, q=50ms SJF (non-preemptive) PSJF The following are the results of the simulation: Policy #1 #2 #3 #4 Total CST 996 824 1206 824 Avg. wait time 12166.79 16865.23 17497.24 12188.6 Std dev of wait time 232.27 26.14 14.91 229.51 Which policies correspond to #1, #2, #3, and #4 in the table? v #1 A. FCFS v #2 B. RR, q=50ms #3 C. SJE v #4 D. PSJF

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Machine Learning And Knowledge Discovery In Databases European Conference Ecml Pkdd 2015 Porto Portugal September 7 11 2015 Proceedings Part 1 Lnai 9284

Authors: Annalisa Appice ,Pedro Pereira Rodrigues ,Vitor Santos Costa ,Carlos Soares ,Joao Gama ,Alipio Jorge

1st Edition

3319235273, 978-3319235271

More Books

Students also viewed these Databases questions