{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lec19-Scheduling II - National University of Computer...

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

View Full Document Right Arrow Icon
Operating System Operating System Spring 09 Spring 09 National University National University of Computer & Emerging Sciences of Computer & Emerging Sciences Lec19-Scheduling II Lec19-Scheduling II Prepared by Prepared by Uzma Maroof Uzma Maroof [email protected]
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
2 Reference Material Reference Material Chapter 6 CPU Scheduling Operating system concepts Sixth edition Silberschatz
Background image of page 2
3 Priority scheduling Priority scheduling Not all jobs equal So: rank them. Each process has a priority Run highest priority ready job in system Priorities can be static or dynamic or both Among the Processes of equal priority Round robin FCFS
Background image of page 3

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

View Full Document Right Arrow Icon
4 Priority scheduling Priority scheduling Priority scheduling can be Preemptive or Non- Preemptive When a process arrives and enters the Ready Queue Its priority is compared with the currently Running Process If Higher Preemptive Scheduling Run the New Thread Non-Preemptive Scheduling Continue running the Current Thread
Background image of page 4
5
Background image of page 5

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

View Full Document Right Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}