The Teacher Computing Scheduling [CP5]. The Teacher Computing Multiprogramming A number of jobs are queued and loaded into memory to be processed. A number.

Slides:

Advertisements

Similar presentations

Topic : Process Management Lecture By: Rupinder Kaur Lecturer IT, SRS Govt. Polytechnic College for Girls,Ludhiana.

Advertisements

CPU Scheduling Questions answered in this lecture: What is scheduling vs. allocation? What is preemptive vs. non-preemptive scheduling? What are FCFS,

IT Systems Multiprocessor System EN230-1 Justin Champion C208 –

A. Frank - P. Weisberg Operating Systems Process Scheduling and Switching.

1/27/2010CSCI 315 Operating Systems Design1 Processes Notice: The slides for this lecture have been largely based on those accompanying an earlier version.

Review: Operating System Manages all system resources ALU Memory I/O Files Objectives: Security Efficiency Convenience.

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.

Chapter 8 Operating System Support

©Brooks/Cole, 2003 Chapter 7 Operating Systems Dr. Barnawi.

OUTLINE What is the Process Management? What is it covers? pprocess state pprocess table, pprocess scheduling.

Computer Organization and Architecture

Processes April 5, 2000 Instructor: Gary Kimura Slides courtesy of Hank Levy.

Operating Systems (CSCI2413) Lecture 3 Processes phones off (please)

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.

E X C E E D I N G E X P E C T A T I O N S Time Mgt Linux System Administration Dr. Hoganson Kennesaw State University OS Time Management Time management.

1 RTOS Design Some of the content of this set of slides is taken from the documentation existing on the FreeRTOS website

CPU Scheduling CSCI 444/544 Operating Systems Fall 2008.

Chapter 7 Operating Systems. Define the purpose and functions of an operating system. Understand the components of an operating system. Understand the.

Process by Dr. Amin Danial Asham. References Operating System Concepts ABRAHAM SILBERSCHATZ, PETER BAER GALVIN, and GREG GAGNE.

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

Process A program in execution. But, What does it mean to be “in execution”?

Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 3: Processes Process Concept Process Scheduling Operations on Processes Cooperating.

The act of Scheduling a process means changing the active PCB pointed to by the CPU. Also called a context switch. A context switch is essentially the.

Uniprocessor Scheduling

CIS250 OPERATING SYSTEMS Chapter 6 - CPU Scheduling Basic Concepts The objective of multi-programming is have a program running at all times Maximize.

Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Process-Concept.

1 Computer Systems II Introduction to Processes. 2 First Two Major Computer System Evolution Steps Led to the idea of multiprogramming (multiple concurrent.

The Functions of Operating Systems Scheduling(multi-programming)

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.

Assoc. Prof. Dr. Ahmet Turan ÖZCERİT.  What Operating Systems Do  Computer-System Organization  Computer-System Architecture  Operating-System Structure.

Operating Systems (CS 340 D) Dr. Abeer Mahmoud Princess Nora University Faculty of Computer & Information Systems Computer science Department.

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

Chapter 3: Processes. 3.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 3: Processes Process Concept Process Scheduling Operations.

Processes 2 Introduction to Operating Systems: Module 4.

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

Process Control Management Prepared by: Dhason Operating Systems.

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

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

CPU scheduling.  Single Process  one process at a time  Maximum CPU utilization obtained with multiprogramming  CPU idle :waiting time is wasted 2.

Lecturer 5: Process Scheduling Process Scheduling  Criteria & Objectives Types of Scheduling  Long term  Medium term  Short term CPU Scheduling Algorithms.

Multiprogramming. Readings r Chapter 2.1 of the textbook.

Copyright ©: Nahrstedt, Angrave, Abdelzaher

Applied Operating System Concepts -

Copyright ©: Nahrstedt, Angrave, Abdelzaher

Operating Systems (CS 340 D)

Sujata Ray Dey Maheshtala College Computer Science Department

Lecture Topics: 11/1 Processes Process Management

April 6, 2001 Gary Kimura Lecture #6 April 6, 2001

Process Description and Control

CPU scheduling 6. Schedulers, CPU Scheduling 6.1. Schedulers

Virtual Memory Networks and Communication Department.

Operating Systems (CS 340 D)

Operating Systems CPU Scheduling.

Chapter 6: CPU Scheduling

Module 5: CPU Scheduling

3: CPU Scheduling Basic Concepts Scheduling Criteria

Process & its States Lecture 5.

Chapter5: CPU Scheduling

Processes Hank Levy 1.

Sujata Ray Dey Maheshtala College Computer Science Department

Lesson Objectives Aims Key Words

Processor Scheduling Hank Levy 1.

Uniprocessor scheduling

Uniprocessor Process Management & Process Scheduling

Module 5: CPU Scheduling

Processes Hank Levy 1.

Chapter 3: Processes Process Concept Process Scheduling

Uniprocessor Process Management & Process Scheduling

Module 5: CPU Scheduling

Presentation transcript:

The Teacher Computing Scheduling [CP5]

The Teacher Computing Multiprogramming A number of jobs are queued and loaded into memory to be processed. A number of different jobs may be stored in memory at the same time. Each job in memory is allocated a small amount of processing time in turn(a time slice).

The Teacher Computing Scheduler The Scheduler is the part of the operating system that decides the order in which jobs are allocated time slices of processing time.

The Teacher Computing Jobs Each job in memory can be… –Running (being processed) –Ready (waiting to be processed) –Blocked (in the middle of being processed but temporarily stopped)

The Teacher Computing Jobs loaded into Memory… All jobs are READY The scheduler selects one for processing…..at the end of the time- slice the scheduler selects another job for processing…..and so on. Each job gets a time-slice of processing time.

The Teacher Computing Blocking During a program’s time slice of processing, it may need some I/O… The I/O is started and the program is ‘Blocked’ so it cannot be processed until I/O is finished… Other programs continue to be processed… …until I/O is finished. The status is set back to ‘Ready’…

The Teacher Computing Priorities The scheduler may allocate priorities to jobs waiting to be processed. Those with higher priorities are more likely to be selected for processing.

The Teacher Computing Scheduling Policies Priority allocation may take into account: –The size of the job. (Small jobs may getter higher priority because they can be processed quickly) –Whether the job requires I/O –The time the job has been waiting for processing. (To prevent jobs getting stuck in the queue)