{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

HW2 - ECEC-353 Systems Programming Solution set for...

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

View Full Document Right Arrow Icon
ECEC-353: Systems Programming Solution set for Homework 2 Prof. Naga Kandasamy, ECE Department, Drexel University July 21, 2011 Problem 5.1. Given n processes, there are n ! ways of scheduling them on a single CPU. Problem 5.2. Preemptive scheduling allows a process to be interrupted in the midst of its execution, taking the CPU away and allocating it to another process. Non-preemptive scheduling ensures that a process relinquishes control of the CPU only when it finishes with its current CPU burst. Problem 5.3. (a) 10.53, (b) 9.53, and (c) 6.86. Since turnaround time is finishing time minus arrival time, we must subtract the arrival times to compute the turnaround times. 1
Background image of page 1

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

View Full Document Right Arrow Icon
Problem 5.12. 2
Background image of page 2
Problem 5.13. Shortest job first and priority-based scheduling algorithms could result in starvation.
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}