5-sol - CHAPTER 5 CPU Scheduling Practice Exercises 5.1 A...

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

View Full Document Right Arrow Icon
5 CHAPTER CPU Scheduling Practice Exercises 5.1 A CPU scheduling algorithm determines an order for the execution of its scheduled processes. Given n processes to be scheduled on one proces- sor, how many possible different schedules are there? Give a formula in terms of n . Answer: n! ( n factorial = n × n –1 × n –2 × ... × 2 × 1). 5.2 DeFne the difference between preemptive and nonpreemptive schedul- ing. Answer: Preemptive scheduling allows a process to be interrupted in the midst of its execution, taking the CPU away and allocating it to another process. Nonpreemptive scheduling ensures that a process relinquishes control of the CPU only when it Fnishes with its current CPU burst. 5.3 Suppose that the following processes arrive for execution at the times indicated. Each process will run the listed amount of time. In answering the questions, use nonpreemptive scheduling and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time P 1 0.0 8 P 2 0.4 4 P 3 1.0 1 a. What is the average turnaround time for these processes with the ±C±S scheduling algorithm?
Background image of page 1

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

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

This homework help was uploaded on 04/05/2008 for the course CSCE 4000 taught by Professor Anonymous during the Spring '08 term at Arkansas.

Page1 / 4

5-sol - CHAPTER 5 CPU Scheduling Practice Exercises 5.1 A...

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