Dale - Computer Science Illuminated 364

Dale - Computer Science Illuminated 364 - 10.4 CPU...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Time slice The amount of time given to each process in the round- robin CPU scheduling algorithm 10.4 CPU Scheduling 337 The FCFS algorithm is easy to implement but suffers from its lack of attention to important factors such as service time requirements. Although the service times were used in our calculations of turnaround time, the algorithm didn’t use that information to help determine the best order in which to schedule the processes. Shortest Job Next The shortest-job-next (SJN) CPU scheduling algorithm looks at all processes in the ready state and dispatches the one with the smallest service time. Like FCFS, it is also generally implemented as a nonpreemptive algorithm. Below is the Gantt chart for the same set of processes we examined in the FCFS example. Because the selec- tion criteria are different, the order in which the processes are scheduled and completed are different: What is a Gantt chart? A Gantt chart is a horizontal bar chart devel-
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online