In a multitasking environment : what is a timeslice (quantum)? what is a context switch? When a large number of processes (jobs) are multitasking the actual.

Slides:



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

Scheduling CSCI 3753 Operating Systems Spring 2005 Prof. Rick Han.
OS, , Part II CPU Scheduling Department of Computer Engineering, PSUWannarat Suntiamorntut.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts Essentials – 2 nd Edition Chapter 6a: CPU Scheduling.
 Basic Concepts  Scheduling Criteria  Scheduling Algorithms.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 5: CPU Scheduling.
Scheduling Algorithms
CPU Scheduling Section 2.5.
Chapter 3: CPU Scheduling
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 5: CPU Scheduling.
Chapter 3 Operating Systems. Chapter 3 Operating Systems 3.1 The Evolution of Operating Systems 3.1 The Evolution of Operating Systems 3.2 Operating System.
Operating System Process Scheduling (Ch 4.2, )
CS 311 – Lecture 23 Outline Kernel – Process subsystem Process scheduling Scheduling algorithms User mode and kernel mode Lecture 231CS Operating.
Scheduling in Batch Systems
I/O Hardware n Incredible variety of I/O devices n Common concepts: – Port – connection point to the computer – Bus (daisy chain or shared direct access)
Job scheduling Queue discipline.
Operating Systems Process Scheduling (Ch 4.2, )
Operating Systems (CSCI2413) Lecture 3 Processes phones off (please)
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 Part III: Process Management (CPU Scheduling)
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.
Chapter 4 Processor Management
OPERATING SYSTEMS CPU SCHEDULING.  Introduction to CPU scheduling Introduction to CPU scheduling  Dispatcher Dispatcher  Terms used in CPU scheduling.
1 Scheduling Processes. 2 Processes Each process has state, that includes its text and data, procedure call stack, etc. This state resides in memory.
Round Robin Scheduling A preemptive scheduling designed for Time Sharing Systems The Ready Queue is treated as a circular queue A small execution.
Chapter 6 Scheduling. Basic concepts Goal is maximum utilization –what does this mean? –cpu pegged at 100% ?? Most programs are I/O bound Thus some other.
Operating Systems Lecture 2 Processes and Threads Adapted from Operating Systems Lecture Notes, Copyright 1997 Martin C. Rinard. Zhiqing Liu School of.
Scheduling Strategies Operating Systems Spring 2004 Class #10.
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.
CPU Scheduling CSCI 444/544 Operating Systems Fall 2008.
CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating Systems Examples Algorithm.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 5: CPU Scheduling.
CE Operating Systems Lecture 7 Threads & Introduction to CPU Scheduling.
Lecture 7: Scheduling preemptive/non-preemptive scheduler CPU bursts
Scanf n, a, b /* I-O wait */ for (i=1; i
CSC 322 Operating Systems Concepts Lecture - 10: by Ahmed Mumtaz Mustehsan Special Thanks To: Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall,
Chapter 2 Process Management. 2 Objectives After finish this chapter, you will understand: the concept of a process. the process life cycle. process states.
Lecture Topics: 11/15 CPU scheduling: –Scheduling goals and algorithms.
Purpose of Operating System Part 2 Monil Adhikari.
CPU Scheduling CSCI Introduction By switching the CPU among processes, the O.S. can make the system more productive –Some process is running at.
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.
Introduction to operating systems What is an operating system? An operating system is a program that, from a programmer’s perspective, adds a variety of.
1 Lecture 5: CPU Scheduling Operating System Fall 2006.
Lecturer 5: Process Scheduling Process Scheduling  Criteria & Objectives Types of Scheduling  Long term  Medium term  Short term CPU Scheduling Algorithms.
Chapter 7 Scheduling Chien-Chung Shen CIS/UD
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 5: CPU Scheduling.
Scheduling.
1 Chapter 5: CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms.
CPU SCHEDULING.
Chapter 6: CPU Scheduling
EEE Embedded Systems Design Process in Operating Systems 서강대학교 전자공학과
Chapter 5a: CPU Scheduling
Lecture Topics: 11/1 Processes Process Management
Priority Scheduling Example
Chapter 6: CPU Scheduling
Operating Systems CPU Scheduling.
Process management Information maintained by OS for process management
CPU Scheduling Basic Concepts Scheduling Criteria
Chapter 6: CPU Scheduling
Chapter 5: CPU Scheduling
CS 143A Quiz 1 Solution.
Operating System Concepts
CS703 - Advanced Operating Systems
Operating systems Process scheduling.
CPU scheduling decisions may take place when a process:
Lecture 2 Part 3 CPU Scheduling
Chapter 6: Scheduling Algorithms Dr. Amjad Ali
CPU Scheduling: Basic Concepts
Presentation transcript:

In a multitasking environment : what is a timeslice (quantum)? what is a context switch? When a large number of processes (jobs) are multitasking the actual length of time spent on each process is determined by the O/S specifications, and the term that is often used to describe it is the ‘quantum’ or a timeslice. The actual changeover of the CPU executing one job and changing over to another is generally referred to as context switch. In a multitasking environment : what is a timeslice (quantum)? what is a context switch? When a large number of processes (jobs) are multitasking the actual length of time spent on each process is determined by the O/S specifications, and the term that is often used to describe it is the ‘quantum’ or a timeslice. The actual changeover of the CPU executing one job and changing over to another is generally referred to as context switch.

What is a timeslicing scheduling policy? A time slicing scheduling policy relies on the O/S allocating each job a predefined time slice (Quantum) which is typically 1ms-10ms. Processes are assigned this quantum which must not be exceeded. As soon as the time quantum has been reached, an interrupt occurs and the executing process is placed at the back of the FIFO queue. A hardware timer that generates an interrupt at pre-set intervals usually provides the time quantum. This policy is pre-emptive which only occurs at expiry of quantum time.

For an 8-bit ISA I/O bus, running at the speed of 8.3MHz calculate the following: Bandwidth of the bus. The amount of time it would take to transfer 4Mbytes of raw data on this I/O bus. Calculate the amount of time it would take to transfer 4Mbytes of raw data on a 64-bit, FSB running at 333MHz.

The file and print server on your network has an I/ O bus which is 16-bits wide, operating at 66MHz. How long would it take to transfer 200MBytes of print data (i.e. single job) on this bus? If you have 50 users connecting to the file server and each of these is transferring 50Mbytes of data (i.e. 50 separate jobs). How long would it take for each of these jobs to complete? How long would each job have to wait in this sequence of 50 jobs?

Compare how scheduling jobs sequentially on a FCFS basis and scheduling each job using a 10mS timeslice figure on the Quality of service to the user. Explain with justification the scheduling policy that you would recommend in order to manage the above data transfer on the server I/O bus. If the context switching time is 50 micro seconds, calculate the amount of time that it would take to complete all the jobs identified above for each scheduling policy.