hw3sol - HOME WORK 3 Question 1 Explain how a Multi-level...

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

View Full Document Right Arrow Icon
HOME WORK 3 Question 1 Explain how a Multi-level feed back queue works. In what situation does a process move to a lower (worse) priority queue? In what situations would it be ok to move a process to a higher (better) priority queue? A multi-level feedback queue works by giving preference to IO bound jobs. It maintains multiple queues which are given different quantum. Processes move into lower (longer quantum) queues by using up their entire quantum and being pre-empted out of the CPU. Processes can be moved up to better priority queues with shorter quantum by yielding or performing blocking system calls. The idea is that processes move up and down and fine a priority level which matches their CPU-burst characteristic. Question 2 How can you simulate a Fair Share scheduler using a lottery scheduler? How could we allow users to change the priority of their own processes? We can simulate a Fair share scheduler with a lottery scheduler by evenly distributing tickets amongst all of the users. We can allow each user to assign
Background image of page 1

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

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

This note was uploaded on 04/02/2012 for the course CIS 486 taught by Professor Mcsweeney during the Spring '10 term at Syracuse.

Page1 / 4

hw3sol - HOME WORK 3 Question 1 Explain how a Multi-level...

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