Activity21 Soln - ECSE-2660 Computer Architecture,...

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 2001 Page 1 of 3 In-Class Activity #21 Due 4-6-01 Last Name First Name Student ID Number Email 21.1 21.2 Total Assigned grader Grader Initials 50 points 50 points 100 points 4/17/2001 5:44 PM Activity 21.1 (First Hour) Process scheduling 1. Consider the following set of processes. Process CPU Burst Time (ms) Arrival Time (ms) P1 10 0 P2 3 2 P3 2 4 P4 3 5 P5 5 7 a. (10 points) Draw a schedule chart 1 showing the execution of these processes using the First-Come First Served (FCFS) algorithm. FCFS (burst times have no effect) 10 13 15 18 23 P1 P2 P3 P4 P5 Grading: 10 pts for correct, 7 for partially correct, 3 for incorrect. b. (10 points) For the same data as above, draw a schedule chart using the Shortest Remaining Time First (SRTF) algorithm. SRTF 2 5 7 10 15 23 P1 P2 P3 P4 P5 P1 At t=5, for example, P1 still has 8ms, P2 has 0ms (completed), P3 has 2ms, P4 has 3ms, so P3 is selected....
View Full Document

Page1 / 3

Activity21 Soln - ECSE-2660 Computer Architecture,...

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