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

Slides:

Advertisements

Similar presentations

PROCESS SCHEDULING AND SYNCRONIZATION

Advertisements

CPU Scheduling.

Chapter 5: CPU Scheduling

Scheduling Introduction to Scheduling

Scheduling Algorithems

Schedulers Long-term scheduler (or job scheduler) – selects which processes should be brought into the ready queue. Short-term scheduler (or CPU scheduler)

CPU Scheduling.

CMT603 Lecture 3 Scheduling. Contents Intro to scheduling Preemption Scheduling Algorithms –?–? –?–? –?–?

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

G53OPS Operating Systems Graham Kendall Q Exam.

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.

Process Control Management Prepared by: Dhason Operating Systems AICT

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.

Operating Systems: Introduction n 1. Historical Development n 2. The OS as a Resource Manager n 3. Definitions n 4. The Process.

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.

Scheduling Algorithms

CPU Scheduling Algorithms

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

1 Scheduling Algorithms FCFS First-Come, First-Served Round-robin SJF Multilevel Feedback Queues.

CPU-Scheduling Whenever the CPU becomes idle, the operating system must select one of the processes in the ready queue to be executed. The short term scheduler.

Computer Architecture and Operating Systems CS 3230: Operating System Section Lecture OS-3 CPU Scheduling Department of Computer Science and Software Engineering.

Chapter 4 Processor Management

CS212: OPERATING SYSTEM Lecture 3: Process Scheduling 1.

OPERATING SYSTEMS CPU SCHEDULING.  Introduction to CPU scheduling Introduction to CPU scheduling  Dispatcher Dispatcher  Terms used in CPU scheduling.

Chapter 6 CPU SCHEDULING.

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.

CPU Scheduling Algorithms Simulation using Java Kaushal Sinha CSC 4320 Spring 2007.

CPU Scheduling Basic Concepts. Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor.

Chapter 5 Processor Scheduling Introduction Processor (CPU) scheduling is the sharing of the processor(s) among the processes in the ready queue.

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

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.

Process Control Management

1 Real-Time Scheduling. 2Today Operating System task scheduling –Traditional (non-real-time) scheduling –Real-time scheduling.

Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.

1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 5 CPU Scheduling Slide 1 Chapter 5 CPU Scheduling.

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

Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 5: CPU Scheduling.

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

First In First Out SJF is a scheduling policy that selects a waiting process with the smallest execution time to execute next. Shortest Job First Shortest.

Process Scheduling In multiprogramming systems, when there is more than one ready process, the operating system must decide which one to activate. The.

Basic Concepts Maximum CPU utilization obtained with multiprogramming

1 Lecture 5: CPU Scheduling Operating System Fall 2006.

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

1 Chapter 5: CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms.

CPU SCHEDULING.

CPU scheduling 6. Schedulers, CPU Scheduling 6.1. Schedulers

CPU scheduling 6. Schedulers, CPU Scheduling 6.1. Schedulers

Scheduling (Priority Based)

CPU Scheduling.

זימון תהליכים מדיניות בסיסיות: RR, FCFS, SJF

CS 143A – Winter 2013 Quiz 2 Solutions.

CPU Scheduling Basic Concepts Scheduling Criteria

Lecture 16 Syed Mansoor Sarwar

Operating Systems Lecture 15.

Chapter5: CPU Scheduling

Processes and Threads Part III

Operating systems Process scheduling.

Exercise Ms.Reema alOraini

Chapter 5: CPU Scheduling

Process Management Scheduling

Q:何謂 CPU BURST與 I/O BURST?

Uniprocessor Process Management & Process Scheduling

CPU SCHEDULING CPU SCHEDULING.

Uniprocessor Process Management & Process Scheduling

CPU Scheduling.

Chapter 5: CPU Scheduling

Presentation transcript:

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

PRESENTATION CPU Scheduling Made by : Muhammad Usman Amir 2009-CS-005

CPU SCHEDULING The task of selecting a waiting process from the ready Queue and allocation the CPU to it. The CPU is allocated to the selected process by the dispatcher

CPU SCHEDULING ALGORITHMS There are four types of CPU Scheduling Algorithms are given below: 1. First Come First Served (FCFS) 2. Shortest Job First (SJF) 3. Priority Scheduling 4. Round Robin Scheduling

ROUND ROBIN SCHEDULING The Round Robin Algorithm designed specially for time sharing system new processors are added to the tail of the ready queue

EXAMPLE Process Burst Time P124 P23 P33 P1P2P3P

THANK YOU