Uniprocessor Scheduling Chapter 9. Aim of Scheduling The key to multiprogramming is scheduling Scheduling is done to meet the goals of –Response time.

Slides:



Advertisements
Similar presentations
Uniprocessor Scheduling Chapter 9 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice,
Advertisements

Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice,
Chapter 9 Uniprocessor Scheduling
1 Uniprocessor Scheduling Types of scheduling –The aim of processor scheduling is to assign processes to be executed by the processor so as to optimize.
Chapter 9 Uniprocessor Scheduling
Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles, 6/E William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008,
Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles, 6/E William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008,
Ceng Operating Systems Chapter 2.2 : Process Scheduling Process concept  Process scheduling Interprocess communication Deadlocks Threads.
Day 25 Uniprocessor scheduling. Algorithm: Selection function Selection function – which process among ready processes to select. w – time spent in system,
Chapter 3: CPU Scheduling
Chapter 9 Uniprocessor Scheduling
Scheduling in Batch Systems
1 Uniprocessor Scheduling Module CPU Scheduling n We concentrate on the problem of scheduling the usage of a single processor among all the existing.
Chapter 5-CPU Scheduling
Chapter 9 Uniprocessor Scheduling
1 Uniprocessor Scheduling Chapter 9. 2 Aims of Scheduling Assign processes to be executed by the processor(s) Response time Throughput Processor efficiency.
Informationsteknologi Tuesday, October 9, 2007Computer Systems/Operating Systems - Class 141 Today’s class Scheduling.
A. Frank - P. Weisberg Operating Systems CPU Scheduling.
1 Lecture 10: Uniprocessor Scheduling. 2 CPU Scheduling n The problem: scheduling the usage of a single processor among all the existing processes in.
1Chapter 05, Fall 2008 CPU Scheduling The CPU scheduler (sometimes called the dispatcher or short-term scheduler): Selects a process from the ready queue.
Chapter 9 Uniprocessor Scheduling Seventh Edition By William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008, Prentice Hall Operating Systems: Internals.
1 Uniprocessor Scheduling Chapter 9. 2 Aim of Scheduling Main Job: Assign processes to be executed by the processor(s) and processes to be loaded in main.
Chapter 9 Uniprocessor Scheduling Seventh Edition By William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008, Prentice Hall Operating Systems: Internals.
Uniprocessor Scheduling
CPU Scheduling Chapter 6 Chapter 6.
Chapter 6: CPU Scheduling
Computer Architecture and Operating Systems CS 3230: Operating System Section Lecture OS-3 CPU Scheduling Department of Computer Science and Software Engineering.
10CSE CPU Scheduling Copyrights Lecture Slides adapted from “ Advanced Operating Systems ”, Lecture Notes by Prof. Prof. Daniel Mosse, University Of Pittsburgh,
Lecture 5: Uniprocessor Scheduling
1 Uniprocessor Scheduling Chapter 9. 2 CPU Scheduling We concentrate on the problem of scheduling the usage of a single processor among all the existing.
Chapter 9 Uniprocessor Scheduling Spring, 2011 School of Computer Science & Engineering Chung-Ang University.
Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice,
Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice,
Chapter 6 CPU SCHEDULING.
Chapter 9 Uniprocessor Scheduling Seventh Edition By William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008, Prentice Hall Operating Systems: Internals.
Operating System Chapter 9. Uniprocessor Scheduling
Operating Systems Process Management.
Uniprocessor Scheduling Chapter 9. Aim of Scheduling To improve: Response time: time it takes a system to react to a given input Turnaround Time (TAT)
Uniprocessor Scheduling Chapter 9. Aim of Scheduling Minimize response time Maximize throughput Maximize processor efficiency.
Fall 2000M.B. Ibáñez Lecture 11 Uniprocessor Scheduling.
1 Uniprocessor Scheduling Chapter 9. 2 CPU Scheduling n We concentrate on the problem of scheduling the usage of a single processor among all the existing.
Lecture 7: Scheduling preemptive/non-preemptive scheduler CPU bursts
1 Uniprocessor Scheduling Chapter 9. 2 Aim of Scheduling Response time Throughput Processor efficiency.
Uniprocessor Scheduling Chapter 9. Aim of Scheduling Response time Throughput Processor efficiency.
Uniprocessor Scheduling
Operating System 9 UNIPROCESSOR SCHEDULING. TYPES OF PROCESSOR SCHEDULING.
Uniprocessor Scheduling Chapter 9. Processor Scheduling Processor scheduling determines the assignment of processes to be executed by the processor over.
Chapter 5: Process Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Basic Concepts Maximum CPU utilization can be obtained.
Uniprocessor Scheduling Chapter 9. Aim of Scheduling Assign processes to be executed by the processor or processors: –Response time –Throughput –Processor.
1 Uniprocessor Scheduling Chapter 3. 2 Alternating Sequence of CPU And I/O Bursts.
Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles, 6/E William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008,
Basic Concepts Maximum CPU utilization obtained with multiprogramming
1 Lecture 5: CPU Scheduling Operating System Fall 2006.
1 Chapter 5: CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms.
1 Uniprocessor Scheduling Chapter 9. 2 Aim of Scheduling Assign processes to be executed by the processor(s) Response time Throughput Processor efficiency.
Uniprocessor Scheduling Chapter 9 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice,
Uniprocessor Scheduling
Uniprocessor Scheduling
CPU Scheduling Chapter 5.
Uniprocessor Scheduling
Chapter 2.2 : Process Scheduling
Operating Systems CPU Scheduling.
Chapter 6: CPU Scheduling
OverView of Scheduling
Operating System Chapter 9. Uniprocessor Scheduling
Chapter 9 Uniprocessor Scheduling
Operating System 9 UNIPROCESSOR SCHEDULING
Chapter 9 Uniprocessor Scheduling
Uniprocessor Scheduling
Uniprocessor Scheduling
Presentation transcript:

Uniprocessor Scheduling Chapter 9

Aim of Scheduling The key to multiprogramming is scheduling Scheduling is done to meet the goals of –Response time –Throughput –Processor efficiency

Tanenbaum Models

Types of Scheduling

Three Types Long term scheduling: Degree of multiprogramming in the system Medium term scheduling: Disk to memory migration Short term scheduling: Ready to running migration

Long-Term Scheduling Determines which programs are admitted to the system for processing Controls the degree of multiprogramming More processes, smaller percentage of time each process is executed

Medium-Term Scheduling Part of the swapping function Disk to main memory (swap-in or swap- out) Based on the need to manage the degree of multiprogramming

Short-Term Scheduling Known as the dispatcher Executes most frequently Invoked when an event occurs –Clock interrupts –I/O interrupts –Operating system calls –Signals

Short-Tem Scheduling Criteria User-oriented –Response Time Elapsed time between the submission of a request until there is output. System-oriented –Effective and efficient utilization of the processor i.e. throughput –Not important on single-user system

Short-Term Scheduling Criteria Performance-related –Quantitative –Measurable such as response time and throughput Not performance related –Qualitative –Predictability (The system appears same to the users over a period of time)

Priorities Scheduler will always choose a process of higher priority over one of lower priority Have multiple ready queues to represent each level of priority Lower-priority may suffer starvation –allow a process to change its priority based on its age or execution history

Decision Mode Nonpreemptive –Once a process is in the running state, it will continue until it terminates or blocks itself for I/O Preemptive –Currently running process may be interrupted and moved to the Ready state by the operating system –More overhead but allows for better service since any one process cannot monopolize the processor for very long

Process Scheduling Example

First-Come-First-Served (FCFS) Each process joins the Ready queue When the current process ceases to execute, the oldest process in the Ready queue is selected A B C D E

First-Come-First-Served (FCFS) A short process may have to wait a very long time before it can execute Favors processor bound processes –I/O processes have to wait until processor bound process completes –Then the I/O bound process quickly runs its processor cycle and blocks again for I/O

Round-Robin Uses preemption based on a clock An amount of time is determined that allows each process to use the processor for that length of time A B C D E

Round-Robin Clock interrupt is generated at periodic intervals When an interrupt occurs, the currently running process is placed in the ready queue and the next ready job is selected Known as time slicing; If slice is short, large overhead in switching tasks If each process runs to completion, RR changes into FCFS To avoid unfair treatment of I/O bound processes, VRR prefers older processes over newer ones

Shortest Process Next Nonpreemptive policy to prefer short processes Process with shortest expected processing time is selected next Short process jumps ahead of longer processes ABCDEABCDE

Shortest Process Next How to estimate the process length? EWMA is used to estimate duration. It gives more weight to recent burst times Predictability of longer processes is reduced If estimated time for process not correct, the operating system may abort it Possibility of starvation for longer processes

Shortest Remaining Time Preemptive version of SPN policy Must estimate processing time Similar features as SPN but better turnaround because a short new process is preferred ABCDEABCDE

Highest Response Ratio Next (HRRN) Choose next process with the lowest ratio R where R is time spent waiting + expected service time expected service time ABCDEABCDE

HRRN When a process is new, waiting time is zero Thus the minimum value of R is 1.0 If the process is short, R is ________? If the process is waiting for long time, R becomes________? Always choose the process with largest R No starvation

Feedback Penalize jobs that have been running longer Don’t know remaining time process needs to execute but we know how long the process has executed Every time a process is preempted, it is placed in a lower priority queue ABCDEABCDE

Feedback Scheduling All queues run as FCFS except for the lowest priority queue The lowest priority queue runs as RR The feedback scheduling may punish long processes heavily so a variation is suggested that increases the time slice as a process goes down the lower priority queues

Fair-Share Scheduling User’s application runs as a collection of processes (threads) User is concerned about the performance of the application If Computer Science students are running a lot of jobs on the server, Math students should not see performance degradation for their jobs We need to make scheduling decisions based on process sets Each user or group is allocated a weight and this weight translates to fair share

Traditional UNIX Scheduling (Timeshared Interactive Model) Multilevel feedback using round robin within each of the priority queues Priorities are recomputed once per second (time slice = 1 second) Base priority divides all processes into fixed bands of priority levels Adjustment factor used to keep process in its assigned band

Bands Decreasing order of priority –Swapper –Block I/O device control –File manipulation –Character I/O device control –User processes (favoring I/O bound)