Question: Question # 3: Many CPU-scheduling algorithms are parametrized. For example, the RR algorithm requires a parameter to indicate the time slice. These algorithms are thus

Question # 3:

Many CPU-scheduling algorithms are parametrized. For example, the RR algorithm requires a parameter to indicate the time slice.

These algorithms are thus really sets of algorithms (for example, the set of RR algorithms for all time slices, and so on). One set of algorithms may include another (for example, the FCFS algorithm is the RR algorithm with an infinite time quantum.

What (if any) relation holds between the following pairs of sets of algorithms?

(a) Priority and SJF(shortest job first)

(b) Round Robin and SJF

(c) Priority and FCFS (First Come First Served)

(d) Multilevel feedback queues and FCFS

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Accounting Questions!