Lec20-Scheduling III

Lec20-Scheduling III - Method used to select when demote...

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 Lec20-Scheduling III Lec20-Scheduling III Prepared by Prepared by Uzma Maroof Uzma Maroof [email protected] [email protected]
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Reference Material Reference Material Chapter 6 CPU Scheduling Operating system concepts Sixth edition Silberschatz
Background image of page 2
3 Multilevel Feedback Queue Multilevel Feedback Queue Scheduling Scheduling In Multilevel Queue a process is permanently assigned to a queue The queue to which a process should belong is decided statically Multilevel Feedback Queue Scheduling: A Process may move between the Queues Aging can be implemented this way.
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Multilevel Feedback Queue Multilevel Feedback Queue Scheduling Scheduling Multilevel-feedback-queue scheduler defined by: Number of queues Scheduling algorithms for each queue Method used to select when upgrade process
Background image of page 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Method used to select when demote process Method used to determine which queue a process will enter when that process needs service 5 Multilevel Feedback Queue Multilevel Feedback Queue Scheduling Scheduling • Example If a process used too much CPU time, then move it to a lower-priority queue If a process waits too long in a lower priority queue, then move it to a higher priority queue 6 Multilevel Feedback Queue Multilevel Feedback Queue Scheduling Scheduling • Example: Three queues: Q – RR time quantum 8 milliseconds Q 1 – RR time quantum 16 milliseconds Q 2 – FCFS • Scheduling A new job enters queue Q served by RR. Then job receives 8 milliseconds. If not finished in 8 milliseconds, moved to Q 1 . At Q 1 job served by RR. Then receives 16 milliseconds. If not complete, preempted and moved to Q 2 ....
View Full Document

This note was uploaded on 01/23/2011 for the course COE 10001 taught by Professor Abad during the Spring '09 term at Alfaisal University.

Page1 / 6

Lec20-Scheduling III - Method used to select when demote...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online