Multilevel Feedback-Queue Scheduling

Multilevel Feedback-Queue Scheduling - interactive...

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

View Full Document Right Arrow Icon
Multilevel Feedback-Queue Scheduling Problem : If you have processes of higher priority, low priority processes will never run. Solution : Use Process Aging: The longer a process stays in a queue, the priority is artificially increased. The process will be scheduled at some point. After that, the priority is reset to the initial priority. Also, the scheduler benefits
Background image of page 1

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

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

Unformatted text preview: interactive processes by increasing their priority if the CPU burst time is small. The smaller the CPU burst estimate, the higher the priority. The larger the CPU burst estimate the lower priority. Multilevel Feedback-Queue Scheduling P1 P6 P7 P2 P5 P8 Priority 10 9 P3 P4 P9 8 P10 P11 P12 7 Small CPU Burst. Increas e priority Large CPU Burst. Decreas e priority...
View Full Document

This note was uploaded on 01/30/2012 for the course CS 354 taught by Professor Staff during the Fall '08 term at Purdue University-West Lafayette.

Page1 / 2

Multilevel Feedback-Queue Scheduling - interactive...

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

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