os6 - Modified from Lecture Slides for Operating System...

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

View Full Document Right Arrow Icon
Operating Systems : CPU Scheduling (Chapter 6) Sung-Yong Park, Ph.D. Distributed Computing & Communication Laboratory Department of Computer Science Sogang University Modified from Lecture Slides for Operating System Concepts (6 th Edition) by Silberschatz et. al. Sogang University Distributed Computing & Communication Lab. Page 2 Basic Concepts ± Multiprogramming – maximize CPU utilization -> need scheduling. ± CPU–I/O Burst Cycle – Process execution consists of a cycle of CPU execution and I/O wait. ± CPU burst distribution – generally characterized as exponential, with many short CPU bursts, and a few long CPU bursts.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Sogang University Distributed Computing & Communication Lab. Page 3 Histogram of CPU-burst Times I/O bound program CPU bound program Sogang University Distributed Computing & Communication Lab. Page 4 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 non-preemptive . ± All other scheduling is preemptive .
Background image of page 2
Sogang University Distributed Computing & Communication Lab. Page 5 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. Sogang University Distributed Computing & Communication Lab. Page 6 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 (from submission to completion). ± 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 3

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

View Full DocumentRight Arrow Icon
Sogang University Distributed Computing & Communication Lab.
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/20/2010 for the course CS CSE407001 taught by Professor Psy during the Fall '03 term at Sogang University.

Page1 / 15

os6 - Modified from Lecture Slides for Operating System...

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

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