Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 0 Lesson 9 Process Management.

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

1 Processes and Threads Chapter Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.

© 2004, D. J. Foreman 1 Scheduling & Dispatching.

Tutorial 4 Scheduling. Why do we need scheduling? To manage processes according to requirements of a system, like: –User responsiveness or –Throughput.

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.

CS 149: Operating Systems February 3 Class Meeting

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

EEE 435 Principles of Operating Systems Interprocess Communication Pt I (Modern Operating Systems 2.3)

Chapter 2: Processes Topics –Processes –Threads –Process Scheduling –Inter Process Communication (IPC) Reference: Operating Systems Design and Implementation.

Figure 2.8 Compiler phases Compiling. Figure 2.9 Object module Linking.

CS 3013 & CS 502 Summer 2006 Scheduling1 The art and science of allocating the CPU and other resources to processes.

Chapter 6: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 6: CPU Scheduling Basic.

Operating Systems (CSCI2413) Lecture 4 Process Scheduling phones off (please)

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

CMPT 300: Operating Systems Review THIS REIVEW SHOULD NOT BE USED AS PREDICTORS OF THE ACTUAL QUESTIONS APPEARING ON THE FINAL EXAM.

Cs238 CPU Scheduling Dr. Alan R. Davis. CPU Scheduling The objective of multiprogramming is to have some process running at all times, to maximize CPU.

CS 104 Introduction to Computer Science and Graphics Problems Operating Systems (2) Process Management 10/03/2008 Yang Song (Prepared by Yang Song and.

Wk 2 – Scheduling 1 CS502 Spring 2006 Scheduling The art and science of allocating the CPU and other resources to processes.

1 Interprocess Communication Race Conditions Two processes want to access shared memory at same time.

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.

OPERATING SYSTEMS DESIGN AND IMPLEMENTATION Third Edition ANDREW S. TANENBAUM ALBERT S. WOODHULL Yan hao (Wilson) Wu University of the Western.

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.

1 Processes and Threads Chapter Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.

General What is an OS? What do you get when you buy an OS? What does the OS do? What are the parts of an OS? What is the kernel? What is a device.

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.

Processes and Threads.

Chapter 4 Processor Management

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

MM Process Management Karrie Karahalios Spring 2007 (based off slides created by Brian Bailey)

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

SYNCHRONIZATION Module-4. scheduling Scheduling is an operating system mechanism that arbitrate CPU resources between running tasks. Different scheduling.

Chapter 7 Scheduling Chien-Chung Shen CIS, UD

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.

Round Robin Scheduling A preemptive scheduling designed for Time Sharing Systems The Ready Queue is treated as a circular queue A small execution.

Scheduling Basic scheduling policies, for OS schedulers (threads, tasks, processes) or thread library schedulers Review of Context Switching overheads.

Scheduling Strategies Operating Systems Spring 2004 Class #10.

ICS Principles of Operating Systems Lecture 5 - CPU Scheduling Prof. Nalini Venkatasubramanian

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 Scheduling The part of the OS that makes the choice of which process to run next is called the scheduler and the algorithm it uses is called the scheduling.

Lecture 7: Scheduling preemptive/non-preemptive scheduler CPU bursts

Cpr E 308 Spring 2005 Process Scheduling Basic Question: Which process goes next? Personal Computers –Few processes, interactive, low response time Batch.

ITFN 2601 Introduction to Operating Systems Lecture 4 Scheduling.

Process Control Management

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

1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.

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

1 Uniprocessor Scheduling Chapter 3. 2 Alternating Sequence of CPU And I/O Bursts.

Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.

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

Chapter 7 Scheduling Chien-Chung Shen CIS/UD

 Operating system.  Functions and components of OS.  Types of OS.  Process and a program.  Real time operating system (RTOS).

Copyright ©: Nahrstedt, Angrave, Abdelzaher

Copyright ©: Nahrstedt, Angrave, Abdelzaher

Uniprocessor Scheduling

Networks and Operating Systems: Exercise Session 2

Uniprocessor Scheduling

Chapter 2 Scheduling.

Chapter 2.2 : Process Scheduling

MODERN OPERATING SYSTEMS Third Edition ANDREW S

Process Management with OS

Lecture 21: Introduction to Process Scheduling

OverView of Scheduling

TDC 311 Process Scheduling.

Chapter 9 Uniprocessor Scheduling

Lecture 21: Introduction to Process Scheduling

Uniprocessor scheduling

Presentation transcript:

Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 0 Lesson 9 Process Management

Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 1 LESSON OVERVIEW  The process model  Implementation of processes  Interprocess communication (IPC)  Process scheduling  Deadline scheduling

Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 2 The Process Model  Virtual time  Virtual memory  Process hierarchies  Process states and transitions

Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 3 Implementation Of Process  Process table  Process table entry (PTE)  Level principle  Data Structure  Interrupt vector

Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 4 Race Conditions It is occurs when two processes can interact and the outcome depends on the order in which the processes execute.

Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 5 Requirements For Critical Sections Implementation  No two processes may be simultaneously inside their critical section.  No assumption may be made about the speeds or the number of CPUs.  No process outside its critical section may block other processes.  No process should have to wait forever to enter its critical section.

Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 6 Objectives Of A Good Scheduling Policy  Degrade gracefully under load.  Fair across projects  Low response time  High throughput  Fairness  Efficiency  Repeatability  Low turnaround time

Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 7 Preemption  It means the operating system moves a process from running to ready without the process requesting it.  Without it, the system implements ``run to completion (or yield or block)''.  It needs a clock interrupt (or equivalent).  It is needed to guarantee fairness.  Found in all modern general-purpose operating systems.

Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 8 Deadline Scheduling This is used for real time systems. The objective of the scheduler is to find a schedule for all the tasks (there are a fixed set of tasks) so that each meets its deadline. The run time of each task is known in advance.

Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 9 First Come First Served (FCFS) If the OS doesn't schedule, it still needs to store the PTEs somewhere. If it is a queue you get FCFS. If it is a stack (strange), you get LCFS (Last Come First Served).  Only FCFS is considered.  The simplest scheduling policy.  Non-preemptive.

Copyright © Genetic Computer School 2008 Computer Systems Architecture SA Round Robbin (RR)  An important preemptive policy.  Essentially the preemptive version of FCFS.  The key parameter is the quantum size q.