Consider a variant of the RR scheduling algorithm where the entries in the ready queue are pointers
Question:
Consider a variant of the RR scheduling algorithm where the entries in the ready queue are pointers to the PCBs.
a. What would be the effect of putting two pointers to the same process in the ready queue?
b. What would be the major advantage of this scheme?
c. How could you modify the basic RR algorithm to achieve the same effect without the duplicate pointers?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Operating Systems Internals and Design Principles
ISBN: 978-0133805918
8th edition
Authors: William Stallings
Question Posted: