Homework11-sol - ECSE-2660 Computer Architecture, Networks,...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: ECSE-2660 Computer Architecture, Networks, & Operating Systems, Spring 2002 Page 1 of 2 Homework #11 (Solution) 4/15/2003 9:44 PM Process scheduling 1. (10 points) What is the handicap of priority scheduling, and what is the solution for it? Lower priority processes gets postponed indefinitely. So, priority scheduling may cause lower priority processes to starve and never finish execution. This problem is also known as “starvation” problem. The solution to starvation is to employ “aging”, i.e. increase priority of processes as time progresses. This way lower priority processes are guaranteed to access the resources (i.e. CPU) some time in future and hence prevent starvation. Grading: 2pts for trying; +3pts each for mentioning about the two key words “starvation” and “aging”. 10pts for clearly explained correct answer. 2. The first two columns of the following table are measured (i.e., actual) CPU burst times t , t 1 ,... 5 t (in milliseconds) of a process. a. (25 points) Use exponential averaging with 1 . = α to predict the next burst time τ 6 assuming that the prediction for the first burst, τ , is 2ms. Repeat this calculation with , is 2ms....
View Full Document

This note was uploaded on 04/25/2010 for the course ECSE ecse-2340 taught by Professor Wozny during the Spring '09 term at Rensselaer Polytechnic Institute.

Page1 / 2

Homework11-sol - ECSE-2660 Computer Architecture, Networks,...

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