Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS 140 Lecture Notes: CPU SchedulingSlide 1 BCA time100101103 FCFS BA time25103 Round Robin CACA Scenario #1 A 100ms B 1ms C 2ms Ready Queue Avg: 101.3.

Published byIrma Terry Modified over 9 years ago

Similar presentations

Presentation on theme: "CS 140 Lecture Notes: CPU SchedulingSlide 1 BCA time100101103 FCFS BA time25103 Round Robin CACA Scenario #1 A 100ms B 1ms C 2ms Ready Queue Avg: 101.3."— Presentation transcript:

1 CS 140 Lecture Notes: CPU SchedulingSlide 1 BCA time100101103 FCFS BA time25103 Round Robin CACA Scenario #1 A 100ms B 1ms C 2ms Ready Queue Avg: 101.3 Avg: 36.7

2 CS 140 Lecture Notes: CPU SchedulingSlide 2 Scenario #2 BCA time102030 FCFS BA time282930 Round Robin CACB... BACACB A 10ms B 10ms C 10ms Avg: 20 Avg: 29 Ready Queue

3 CS 140 Lecture Notes: CPU SchedulingSlide 3 Scenario #1 Avg: 101.3 A 100ms B 1ms C 2ms Avg: 36.7 13103 STCF Avg: 35.7 BCA time100101103 FCFS BA time25103 Round Robin CACA ABC Ready Queue

4 CS 140 Lecture Notes: CPU SchedulingSlide 4 Scenario #2 BCA time102030 FCFS BA time282930 Round Robin CAC Avg: 20 B... BACACB A 10ms B 10ms C 10ms Avg: 29 BCA time102030 STCF Avg: 20 Ready Queue

5 CS 140 Lecture Notes: CPU SchedulingSlide 5

Download ppt "CS 140 Lecture Notes: CPU SchedulingSlide 1 BCA time100101103 FCFS BA time25103 Round Robin CACA Scenario #1 A 100ms B 1ms C 2ms Ready Queue Avg: 101.3."

Similar presentations

ASSIGNMENT NO # 01 INTRODUCTION TO OPERATING SYSTEM Submitted to: Miss Sana.

ASSIGNMENT NO # 01 INTRODUCTION TO OPERATING SYSTEM Submitted to: Miss Sana.
CMT603 Lecture 3 Scheduling. Contents Intro to scheduling Preemption Scheduling Algorithms –?–? –?–? –?–?

CMT603 Lecture 3 Scheduling. Contents Intro to scheduling Preemption Scheduling Algorithms –?–? –?–? –?–?
Tutorial 4 Scheduling. Why do we need scheduling? To manage processes according to requirements of a system, like: –User responsiveness or –Throughput.

Tutorial 4 Scheduling. Why do we need scheduling? To manage processes according to requirements of a system, like: –User responsiveness or –Throughput.
CMT603 Lecture 4 Scheduling-2. Contents Last Week –FCFS –SJF Priority scheduling Round Robin Multi Level Queues Real Systems –Linux –XP.

CMT603 Lecture 4 Scheduling-2. Contents Last Week –FCFS –SJF Priority scheduling Round Robin Multi Level Queues Real Systems –Linux –XP.
G53OPS Operating Systems Graham Kendall Q3 2000 Exam.

G53OPS Operating Systems Graham Kendall Q Exam.
CPU Scheduling Tanenbaum Ch 2.4 Silberchatz and Galvin Ch 5.

CPU Scheduling Tanenbaum Ch 2.4 Silberchatz and Galvin Ch 5.
Topic : Process Management Lecture By: Rupinder Kaur Lecturer IT, SRS Govt. Polytechnic College for Girls,Ludhiana.

Topic : Process Management Lecture By: Rupinder Kaur Lecturer IT, SRS Govt. Polytechnic College for Girls,Ludhiana.
1 First Come, First Served (FCFS) The simplest algorithm –When a process becomes ready, it enters the FIFO queue. –When the currently-running process ceases.

1 First Come, First Served (FCFS) The simplest algorithm –When a process becomes ready, it enters the FIFO queue. –When the currently-running process ceases.
240-323 OS,2000 1 240-323, Part II CPU Scheduling Department of Computer Engineering, PSUWannarat Suntiamorntut.

OS, , Part II CPU Scheduling Department of Computer Engineering, PSUWannarat Suntiamorntut.
CH 5. CPU Scheduling 2015-04-14. 5.1 Basic Concepts F CPU Scheduling  context switching u CPU switching for another process u saving old PCB and loading.

CH 5. CPU Scheduling Basic Concepts F CPU Scheduling  context switching u CPU switching for another process u saving old PCB and loading.
Operating Systems Process Scheduling (Ch 3.2, 5.1-5.3)

Operating Systems Process Scheduling (Ch 3.2, )
Operating Systems: Introduction n 1. Historical Development n 2. The OS as a Resource Manager n 3. Definitions n 4. The Process.

Operating Systems: Introduction n 1. Historical Development n 2. The OS as a Resource Manager n 3. Definitions n 4. The Process.
Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems David Goldschmidt, Ph.D.

Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems David Goldschmidt, Ph.D.
Rensselaer Polytechnic Institute CSC 432 – Operating Systems David Goldschmidt, Ph.D.

Rensselaer Polytechnic Institute CSC 432 – Operating Systems David Goldschmidt, Ph.D.
CPU Scheduling Questions answered in this lecture: What is scheduling vs. allocation? What is preemptive vs. non-preemptive scheduling? What are FCFS,

CPU Scheduling Questions answered in this lecture: What is scheduling vs. allocation? What is preemptive vs. non-preemptive scheduling? What are FCFS,
Operating System CS105. Objectives Role of an operating system Manages resources – Memory – CPU – Secondary storage – I/O devices Memory CPU Hard Disk.

Operating System CS105. Objectives Role of an operating system Manages resources – Memory – CPU – Secondary storage – I/O devices Memory CPU Hard Disk.
CPU Scheduling CPU Scheduler Performance metrics for CPU scheduling

CPU Scheduling CPU Scheduler Performance metrics for CPU scheduling
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, 2005 6.1 Operating System Concepts Operating Systems Lecture 17 Scheduling III.

Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 17 Scheduling III.
Homework 2 Sarah Diesburg Operating Systems COP 4610.

Homework 2 Sarah Diesburg Operating Systems COP 4610.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, 2005 6.1 Operating System Concepts Operating Systems Lecture 16 Scheduling II.

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

Similar presentations

Ads by Google