Chapter 6 - CPU Scheduling

Chapter 6 - CPU Scheduling - Chapter 6: CPU Scheduling s...

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

View Full Document Right Arrow Icon
Silberschatz, Galvin and Gagne 2002 6.1 Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation
Background image of page 1

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

View Full DocumentRight Arrow Icon
Silberschatz, Galvin and Gagne 2002 6.2 Operating System Concepts Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU–I/O Burst Cycle – Process execution consists of a cycle of CPU execution and I/O wait. CPU burst distribution
Background image of page 2
Silberschatz, Galvin and Gagne 2002 6.3 Operating System Concepts Alternating Sequence of CPU And I/O Bursts
Background image of page 3

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

View Full DocumentRight Arrow Icon
Silberschatz, Galvin and Gagne 2002 6.4 Operating System Concepts Histogram of CPU-burst Times
Background image of page 4
Silberschatz, Galvin and Gagne 2002 6.5 Operating System Concepts CPU Scheduler Selects from among the processes in memory that are ready to execute, and allocates the CPU to one of them. CPU scheduling decisions may take place when a process: 1. Switches from running to waiting state. 2. Switches from running to ready state. 3. Switches from waiting to ready. 4. Terminates. Scheduling under 1 and 4 is nonpreemptive . All other scheduling is preemptive.
Background image of page 5

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

View Full DocumentRight Arrow Icon
Silberschatz, Galvin and Gagne 2002 6.6 Operating System Concepts Dispatcher Dispatcher module gives control of the CPU to the process selected by the short-term scheduler; this involves: switching context switching to user mode jumping to the proper location in the user program to restart that program Dispatch latency – time it takes for the dispatcher to stop one process and start another running.
Background image of page 6
Silberschatz, Galvin and Gagne 2002 6.7 Operating System Concepts Scheduling Criteria CPU utilization – keep the CPU as busy as possible Throughput – # of processes that complete their execution per time unit Turnaround time – amount of time to execute a particular process Waiting time – amount of time a process has been waiting in the ready queue Response time – amount of time it takes from when a request was submitted until the first response is produced, not output (for time- sharing environment)
Background image of page 7

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

View Full DocumentRight Arrow Icon
Silberschatz, Galvin and Gagne 2002 6.8 Operating System Concepts Optimization Criteria Max CPU utilization Max throughput Min turnaround time Min waiting time Min response time
Background image of page 8
Silberschatz, Galvin and Gagne 2002 6.9 Operating System Concepts First-Come, First-Served (FCFS) Scheduling Process Burst Time P 1 24 P 2 3 P 3 3 Suppose that the processes arrive in the order:
Background image of page 9

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

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

Page1 / 34

Chapter 6 - CPU Scheduling - Chapter 6: CPU Scheduling s...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online