{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

InClassActivity21-sol

# InClassActivity21-sol - Activity#21(Solution 5:03 PM...

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

ECSE-2660 Computer Architecture, Networks, & Operating Systems, Spring 2003 Page 1 of 2 Activity #21 (Solution) 4/11/2003 5:03 PM Activity 21.1 Process scheduling Consider the following set of processes. Process CPU Burst Time (ms) Arrival Time (ms) P1 9 0 P2 3 1 P3 1 4 P4 2 7 P5 6 15 a. (20 points) Draw two schedule charts 1 showing the execution of these processes using the following two algorithms: First-Come First Served (FCFS) Shortest Remaining Time First (SRTF) FCFS (burst times have no effect) 9 12 13 15 21 P1 P2 P3 P4 P5 SRTF 1 4 5 7 9 15 21 P1 P2 P3 P1 P4 P1 P5 Grading: 4pts for trying. For each algorithm: +4pts for partially correct answer, +8pts for correct answer. b. (13 points) What is the turn-around time (i.e., Finish Time – Arrival Time) for each process for each of the scheduling algorithms in part (a)? Write your answer in the table shown. Grading: 1pt off for any incorrect entry in the table, up to 13pts. c. (13 points) For the algorithms defined in part (a), what is the waiting time for each process? Include the time spent waiting in queues.

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

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

{[ snackBarMessage ]}

### Page1 / 2

InClassActivity21-sol - Activity#21(Solution 5:03 PM...

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

View Full Document
Ask a homework question - tutors are online