Uniprocessor Scheduling III CPSC 410 Operating Systems Department of Physics, Computer Science and Engineering Christopher Newport University.

Slides:

Advertisements

Similar presentations

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

Advertisements

Chapter 9 Uniprocessor Scheduling

Scheduling Criteria CPU utilization – keep the CPU as busy as possible (from 0% to 100%) Throughput – # of processes that complete their execution per.

CS 149: Operating Systems February 3 Class Meeting

OS, , Part II CPU Scheduling Department of Computer Engineering, PSUWannarat Suntiamorntut.

CH 5. CPU Scheduling Basic Concepts F CPU Scheduling  context switching u CPU switching for another process u saving old PCB and loading.

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.

Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 17 Scheduling III.

Operating Systems Chapter 6

Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.

Operating Systems CPU Scheduling. Agenda for Today What is Scheduler and its types Short-term scheduler Dispatcher Reasons for invoking scheduler Optimization.

Ceng Operating Systems Chapter 2.2 : Process Scheduling Process concept  Process scheduling Interprocess communication Deadlocks Threads.

CPU Scheduling Algorithms

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

CS 311 – Lecture 23 Outline Kernel – Process subsystem Process scheduling Scheduling algorithms User mode and kernel mode Lecture 231CS Operating.

02/06/2008CSCI 315 Operating Systems Design1 CPU Scheduling Algorithms Notice: The slides for this lecture have been largely based on those accompanying.

What we will cover…  CPU Scheduling  Basic Concepts  Scheduling Criteria  Scheduling Algorithms  Evaluations 1-1 Lecture 4.

Chapter 5-CPU Scheduling

Uniprocessor Scheduling II

02/11/2004CSCI 315 Operating Systems Design1 CPU Scheduling Algorithms Notice: The slides for this lecture have been largely based on those accompanying.

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.

Lecture 5: Uniprocessor Scheduling

CPU Scheduling Introduction to Operating Systems: Module 13.

Chapter 4 Processor Management

COT 4600 Operating Systems Spring 2011 Dan C. Marinescu Office: HEC 304 Office hours: Tu-Th 5:00-6:00 PM.

More Scheduling cs550 Operating Systems David Monismith.

Chapter 9 Uniprocessor Scheduling Seventh Edition By William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008, Prentice Hall Operating Systems: Internals.

Scheduling Chap 2. Scheduling Introduction to Scheduling (1) Bursts of CPU usage alternate with periods of I/O wait –a CPU-bound process –an I/O bound.

Classification of scheduling policies Preemptive methods (typical representative: RR) Non-preemptive methods (typical representative: FCFS) Preemption.

Scheduling. Alternating Sequence of CPU And I/O Bursts.

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)

1 Our focus  scheduling a single CPU among all the processes in the system  Key Criteria: Maximize CPU utilization Maximize throughput Minimize waiting.

Alternating Sequence of CPU And I/O Bursts. Histogram of CPU-burst Times.

Scheduling – part 2. Real-time Hard real-time – Mandatory response requirement Soft real-time – Requested response requirement Used in: – robotics, –

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.

1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.

ITFN 2601 Introduction to Operating Systems Lecture 4 Scheduling.

Processor Scheduling Hank Levy. 22/4/2016 Goals for Multiprogramming In a multiprogramming system, we try to increase utilization and thruput by overlapping.

Lecture Topics: 11/15 CPU scheduling: –Scheduling goals and algorithms.

Uniprocessor Process Management & Process Scheduling Department of Computer Science Southern Illinois University Edwardsville Spring, 2016 Dr. Hiroshi.

CPU Scheduling Operating Systems CS 550. Last Time Deadlock Detection and Recovery Methods to handle deadlock – Ignore it! – Detect and Recover – Avoidance.

1 Module 5: Scheduling CPU Scheduling Scheduling Algorithms Reading: Chapter

Basic Concepts Maximum CPU utilization obtained with multiprogramming

1 Lecture 5: CPU Scheduling Operating System Fall 2006.

Lecture 5 Scheduling. Today CPSC Tyson Kendon Updates Assignment 1 Assignment 2 Concept Review Scheduling Processes Concepts Algorithms.

CPU Scheduling Algorithms CSSE 332 Operating Systems Rose-Hulman Institute of Technology.

Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria.

CPU SCHEDULING.

Uniprocessor Scheduling

Chapter 2.2 : Process Scheduling

Day 25 Uniprocessor scheduling

Scheduling (Priority Based)

CPSC 457 Operating Systems

CPU Scheduling.

Lecture 23: Process Scheduling for Interactive Systems

פרק שלישי – תזמון תהליכים

CPU Scheduling G.Anuradha

Chapter 6: CPU Scheduling

COT 4600 Operating Systems Spring 2011

Outline Scheduling algorithms Multi-processor scheduling

CGS 3763 Operating Systems Concepts Spring 2013

Processor Scheduling Hank Levy 1.

Uniprocessor Process Management & Process Scheduling

Shortest-Job-First (SJR) Scheduling

Uniprocessor Process Management & Process Scheduling

Presentation transcript:

Uniprocessor Scheduling III CPSC 410 Operating Systems Department of Physics, Computer Science and Engineering Christopher Newport University

Question (1) zConsider the following set of processes: Process Name Arrival Time Processing Time Perform the analysis of a comparison of scheduling policies: FCFS, RR(q=1), RR(q=4), SPN, SRT, HRRN, Feedback(q=1), and Feedback(q=2 i ).

P1 P2 P3 P

Solution of Question 3 - FCFS (3) * Each square represents one time unit. The number refers to the running process First Come First Served (FCFS) Process P i Average Arrival Time T a Service Time T s Finish Time T f Turnaround Time T q T q = T f - T a Normalized T q /T s Turnaround Time

P1 P2 P3 P

Solution of Question 3 – RR (q=1) (5) * Each square represents one time unit. The number refers to the running process Round Robin (RR q=1) Process P i Average Arrival Time T a Service Time T s Finish Time T f Turnaround Time T q T q = T f - T a Normalized T q /T s Turnaround Time

P1 P2 P3 P

Solution of Question 3 – RR (q=4) (7) * Each square represents one time unit. The number refers to the running process Round Robin (RR q=4) Process P i Average Arrival Time T a Service Time T s Finish Time T f Turnaround Time T q T q = T f - T a Normalized T q /T s Turnaround Time

P1 P2 P3 P

Solution of Question 3 - SPN (9) * Each square represents one time unit. The number refers to the running process Shortest Process Next (SPN) Process P i Average Arrival Time T a Service Time T s Finish Time T f Turnaround Time T q T q = T f - T a Normalized T q /T s Turnaround Time

P1 P2 P3 P

Solution of Question 3 - SRT (11) * Each square represents one time unit. The number refers to the running process Shortest Remaining Time (SRT) Process P i Average Arrival Time T a Service Time T s Finish Time T f Turnaround Time T q T q = T f - T a Normalized T q /T s Turnaround Time

P1 P2 P3 P

Solution of Question 3 - HRRN (13) * Each square represents one time unit. The number refers to the running process Highest Response Ratio Next (HRRN) Process P i Average Arrival Time T a Service Time T s Finish Time T f Turnaround Time T q T q = T f - T a Normalized T q /T s Turnaround Time

P1 P2 P3 P

Solution of Question 3 – FB q=1 (15) * Each square represents one time unit. The number refers to the running process Feedback (FB q=1) Process P i Average Arrival Time T a Service Time T s Finish Time T f Turnaround Time T q T q = T f - T a Normalized T q /T s Turnaround Time

P1 P2 P3 P

Solution of Question 3 – FB q=2 i (17) * Each square represents one time unit. The number refers to the running process Feedback (FB q=2 i ) Process P i Average Arrival Time T a Service Time T s Finish Time T f Turnaround Time T q T q = T f - T a Normalized T q /T s Turnaround Time

Question 2 - Exercise/Home Work (1) Five batch jobs, A through E, arrive at a computer center at essentially the same time. They have an estimated running time of 15, 9, 3, 6, and 12 minutes, respectively. Their (externally defined) priorities are 4, 7, 3, 1, and 6, respectively, with 10 being the highest priority. For each of the following scheduling algorithms, determine the turnaround time for each process and the average turnaround for all job. Ignore process switching overhead. In the last three cases, assume that only one job at a time runs until it finishes and that all jobs are completely processor-bound. (a) priority scheduling (b) FCFS (run in order 15, 9, 3, 6, and 12) (c) shortest job first.