hw04(3)

hw04(3) - EE 4770 Homework 4 Due: 29 April 1996 The tasks...

Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: EE 4770 Homework 4 Due: 29 April 1996 The tasks described in the table below are run on an otherwise empty system having a quantum of 11 ms and is not task preemptive. Task Creation Round 1 Round 2 Run Name Time ms Priority Class Time ms A 0 1 NA 20 B 10 1 NA 20 C 20 1 NA 20 D 30 2 1 20 E 40 2 2 20 F 50 2 3 20 The OS performs multiround scheduling with a priority policy at round 1 and a FCFS or a roundrobin policy in round 2 such that priority 1 tasks from round 1 are scheduled using FCFS in round 2 and priority 2 tasks from round 1 are scheduled using round robin in round 2. The round robin classes are 1; 2; 3. None of the tasks perform I O. Show the state of each task and the CPU from = 0 until the last task nishes. Do not show time spent in privileged mode assume it is in nitesimal. = = t ...
View Full Document

This note was uploaded on 11/28/2011 for the course EE 4770 taught by Professor Staff during the Fall '99 term at LSU.

Ask a homework question - tutors are online