{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

unit 6 - Operating Systems Betty Wiseman Unit 6 Project The...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Operating Systems Betty Wiseman Unit 6 Project January 29, 2011
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
The Comparisons of the four processor scheduling algorithms: First Come First Served, Round Robin, Shortest Process Next and Shortest Remaining Time. First Come First Served runs the processes in the order they arrive at the short-term scheduler, removes a process from the processor only if it blocks (i.e., goes into the Wait state) or terminates, wonderful for long processes when they finally get on, terrible for short processes if they are behind a long process, and large penalty number indicates being heavily penalized for being in a time-shared system Round Robin processes are given equal time slices called quanta (or quantum’s), takes turns of one quantum each, if a process finishes early, before its quantum expires, the next process starts immediately and gets a full quantum, in some implementations, the next process may get only the rest of the quantum, assume a new process arrives and goes into the queue before the process is removed from the processor The comparisons between First Come First Served and Round Robin are RR has a much lower penalty ratio than FCFS for processes with short cpu bursts, RR gives the processes with short bursts (interactive work) much better service, RR gives processes with long bursts somewhat
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}