Many CPU-scheduling algorithms are parameterized. For example, the RR algorithm

Question

Many CPU-scheduling algorithms are parameterized. For example, the RR algorithm requires a parameter to indicate the time slice. Multilevel feedback queues require parameters to define the number of queues, the scheduling algorithms for each queue, the criteria used to move processes between queues, and so on. These algorithms are thus, more accurately, 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 algorithm sets?

a. Priority and SJF

b. Multilevel feedback queues and FCFS

c. Priority and FCFS

d. RR and SJF

Explanation / Answer

The relations that exists between the following pairs are as follows:

a. Priority and SJF:
Ansd: The relation with these two is that shortest job contains highest priority.

b. Multilevel feedback queues and FCFS :
FCFS is the lowest level in MLFQ.

c. Priority and FCFS :
In First Come First Serve, there is a heighest priority to the job that having existence the longest

d. None.There is no relationship exists.

Related Questions

Navigate

• Browse (All)
• Browse M
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.