Question: The CPU scheduling algorithm (in UNIX) is a simple priority algorithm. The priority for a process is computed as the ratio of the CPU time
The CPU scheduling algorithm (in UNIX) is a simple priority algorithm. The priority for a process is computed as the ratio of the CPU time actually used by the process to the real time that has passed. The lower the figure, the higher the priority. Priorities are recalculated every tenth of a second.
a. What kind of jobs are favored by this type of algorithm?
b. If there is no I/O being performed, this algorithm reduces to a round-robin algorithm. Explain.
c. Discuss this algorithm in terms of the scheduling objectives given in the text.
Step by Step Solution
3.29 Rating (164 Votes )
There are 3 Steps involved in it
a This algorithm favors jobs that require substantial amounts of IO While these jobs are blocked rea... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
1806_60b8c121412e0_722386.pdf
180 KBs PDF File
1806_60b8c121412e0_722386.docx
120 KBs Word File
