Consider the scheduling algorithm in the Solaris operating s

Consider the scheduling algorithm in the Solaris operating system for time-sharing threads.

a. What is the time quantum (in milliseconds) for a thread with priority15? With priority40?

b. Assume that a thread with priority 50 has used its entire time quantum without blocking. What new priority will the scheduler assign this thread?

c. Assume that a thread with priority 20 blocks for I/O before its time quantum has expired. What new priority will the scheduler assign this thread?

Solution

a. Priority 15 will have time quantum of 160ms and the priority 40 will have quantum of 40ms.

b. The new priority which is a lower priority will be 40.

c. The new priority(which is a higher priority will be 52.