COSC243 Part 2: Operating Systems
|
|
- Shawn Hensley
- 5 years ago
- Views:
Transcription
1 COSC243 Part 2: Operating Systems Lecture 17: CPU Scheduling Zhiyi Huang Dept. of Computer Science, University of Otago Zhiyi Huang (Otago) COSC243 Lecture 17 1 / 30
2 Overview Last lecture: Cooperating Processes and Data-Sharing This lecture: Criteria for Scheduling Algorithms Some Scheduling Algorithms: first-come-first-served, shortest-job-first, priority scheduling, round-robin scheduling, multilevel queue scheduling Note: you will have a TUTORIAL EXAM on CPU scheduling in tutorial 11A (14-15 May). It s worth 10%. The questions in Tutorial 10A are practice for this exam. Zhiyi Huang (Otago) COSC243 Lecture 17 2 / 30
3 CPU Scheduling: A Recap A CPU scheduler is the kernel process which determines how to move processes between the ready queue and the CPU. ready queue CPU I/O I/O I/O device queue I/O device queue Child executes I/O request made fork a child interrupt occurs wait for an interrupt time slice expired Zhiyi Huang (Otago) COSC243 Lecture 17 3 / 30
4 Context Switching When the operating system switches between processes, it has a fair amount of housekeeping to do. This housekeeping is known as context switching. Process P0 Operating System Process P1 executing Interrupt or system call save state into PCB0 idle idle reload state from PCB1 Interrupt or system call executing executing Save state into PCB1 Reload state from PCB0 idle Zhiyi Huang (Otago) COSC243 Lecture 17 4 / 30
5 Terminology: Scheduler and Dispatcher The scheduler decides which process to give to the CPU next, and when to give it. Its decisions are carried out by the dispatcher. Dispatching involves Switching context Switching to user mode Jumping to the proper location in the new program. Dispatch latency: the time it takes the dispatcher to do this. Zhiyi Huang (Otago) COSC243 Lecture 17 5 / 30
6 Why Do We Want a Scheduler? (1) One key motivation behind CPU scheduling is to keep the CPU busy. This means removing processes from the CPU while they re waiting. If processes never had to wait, then scheduling wouldn t increase CPU utilisation. However, it s a fact about processes that they tend to exhibit a CPU burst cycle. CPU burst I/O burst CPU burst I/O burst Zhiyi Huang (Otago) COSC243 Lecture 17 6 / 30
7 How Long is a CPU Burst? This is the kind of frequency curve we can expect: frequency CPU burst duration (ms) Zhiyi Huang (Otago) COSC243 Lecture 17 7 / 30
8 Why Do We Want a Scheduler? (2) Another reason for having a scheduler is so that processes don t have to spend too much time waiting for the CPU. Even if the CPU is always busy, executing processes in different orders can change the average amount of time a process spends queueing for the CPU. Total CPU time needed P1 P2 P3 P4 Zhiyi Huang (Otago) COSC243 Lecture 17 8 / 30
9 Why Do We Want a Scheduler? (3) Another reason for having a scheduler is so that interactive processes always respond quickly. One question is how long a process spends waiting for the CPU in total; A different question is how long on average it waits in between visits to the CPU. (Important for interactive processes.) Fast CPU switching P1 P2 P1 P2 P1 P2 P1 P2 time Slower CPU switching P1 P2 P1 P2 Zhiyi Huang (Otago) COSC243 Lecture 17 9 / 30
10 Criteria for Scheduling Algorithms CPU utilisation: the percentage of time that the CPU is busy. Throughput: the number of processes that are completed per time unit. Turnaround time (for a single process): the length of time from when the process was submitted (arrived) to when it is completed. Waiting time (for a single process): the total amount of time the process spends waiting for the CPU. Response time (for a single process): the average time from the submission of a request to a process until the first response is produced. Zhiyi Huang (Otago) COSC243 Lecture / 30
11 Terminology: The Ready Queue head process ID number pointer process state process ID number pointer process state process ID number pointer process state program counter program counter program counter tail Contents of CPU registers memory management information I/O status information Contents of CPU registers memory management information I/O status information Contents of CPU registers memory management information I/O status information Accounting information Accounting information Accounting information Remember: there are two kinds of waiting: Waiting for the CPU (in the ready queue); Waiting for an I/O device (in a device queue). Don t be confused when you hear about processes waiting in the ready queue! Zhiyi Huang (Otago) COSC243 Lecture / 30
12 Terminology: Preemption There are 4 situations for scheduling decisions to take place: 1 a process switches from running to waiting state; 2 a process switches from running to ready (due to an interrupt); 3 a process switches from waiting to ready state (due to completion of I/O); 4 a process terminates. In a non-preemptive scheduling system, scheduling takes place only under 1 and 4, which has no choice. In a preemptive scheduling system, scheduling can take place under 2 and 3 as well. Zhiyi Huang (Otago) COSC243 Lecture / 30
13 Implementing a Preemptive System Implementing preemption is hard. What if a process is preempted while a system call is being executed? Kernel data e.g. I/O queues might be left in an inconsistent state. Earlier versions of UNIX dealt with this problem by waiting until system calls were completed before switching context. Some systems: MS Windows 3.1 and below is nonpreemptive. Windows 95, NT, XP etc are preemptive. Linux is fully preemptive as of 2.6. Zhiyi Huang (Otago) COSC243 Lecture / 30
14 1) First-Come-First-Served Scheduling The simplest method is to execute the processes in the ready queue on a first-come-first-served (FCFS) basis. head process ID number pointer process state process ID number pointer process state process ID number pointer process state program counter program counter program counter tail Contents of CPU registers memory management information I/O status information Contents of CPU registers memory management information I/O status information Contents of CPU registers memory management information I/O status information Accounting information Accounting information Accounting information When a process becomes ready, it is put at the tail of the queue. When the currently executing process terminates, or waits for I/O, the process at the front of the queue is selected next. This algorithm is non-preemptive. Zhiyi Huang (Otago) COSC243 Lecture / 30
15 Gantt Charts The operation of a scheduling algorithm is commonly represented in a Gantt chart. Consider the following process information: Process Arrival Time Burst Time P P2 1 3 P3 2 3 (N.B. We re just looking at the initial CPU burst for each process.) The Gantt chart for FCFS with the above data is: P1 P2 P Zhiyi Huang (Otago) COSC243 Lecture / 30
16 Gantt Charts for Algorithm Evaluation Process Arrival Time Burst Time P P2 1 3 P3 2 3 P1 P2 P Waiting times: P1? 0MS P2? 24-1 = 23MS P3? 27-2 = 25MS Average Waiting Time? ( )/3MS = 16MS Zhiyi Huang (Otago) COSC243 Lecture / 30
17 Gantt Charts for Algorithm Evaluation Process Arrival Time Burst Time P P2 0 3 P3 1 3 P2 P3 P Waiting times: P1? 6-2 = 4MS P2? 0MS P3? 3-1 = 2MS Average Waiting Time? (4+0+2)/3MS = 2MS. Zhiyi Huang (Otago) COSC243 Lecture / 30
18 FCFS: Advantages and Disadvantages ADVANTAGES: EASY TO IMPLEMENT. EASY TO UNDERSTAND. DISADVANTAGES: WAITING TIME NOT LIKELY TO BE MINIMAL. CONVOY EFFECT: LOTS OF SMALL PROCESSES CAN GET STUCK BEHIND ONE BIG ONE. Q: COULD THROUGHPUT (NO OF PROCESSS PER TIME UNIT GOING THROUGH THE SYSTEM) BE IMPROVED? BAD RESPONSE TIME. (SO BAD FOR TIME-SHARING SYSTEMS). Zhiyi Huang (Otago) COSC243 Lecture / 30
19 2) Shortest-Job-First Scheduling If we knew in advance which process on the list had the shortest burst time, we could choose to execute that process next. This method is called shortest-job-first (SJF) scheduling. Example: Process Burst Time P1 6 P2 8 P3 7 P4 3 P4 P1 P3 P N.B. processes with equal burst times are executed in FCFS order. Zhiyi Huang (Otago) COSC243 Lecture / 30
20 SJF: Advantages and Disadvantages ADVANTAGES: PROVABLY OPTIMAL AVERAGE WAITING TIME. DISADVANTAGES: YOU NEVER KNOW IN ADVANCE WHAT THE LENGTH OF THE NEXT CPU BURST IS GOING TO BE. POSSIBILITY OF LONG PROCESSES NEVER GETTING EXECUTED? Zhiyi Huang (Otago) COSC243 Lecture / 30
21 Predicting the next CPU burst length It s possible to approximate the length of the next CPU burst: it s likely to be similar in length to the previous CPU bursts. A commonly-used formula: the exponential average CPU burst length. τ n+1 = α t n + (1 α)τ n τ n : the predicted length of CPU burst n. t n : the actual length of CPU burst n. α: a value between 0 and 1. Zhiyi Huang (Otago) COSC243 Lecture / 30
22 Preemption and SJF Scheduling Scenario: - A process P1 is currently executing. - A new process P2 arrives before P1 is finished. - P2 s burst time is shorter than the remaining burst time of P1. Non-preemptive SJF: P1 keeps the CPU. Preemptive SJF: P2 takes the CPU. Tiny example: Process Arrival Time Burst Time P1 0 8 P2 1 4 P1 P2 P Zhiyi Huang (Otago) COSC243 Lecture / 30
23 3) Priority Scheduling In priority scheduling, each process is allocated a priority when it arrives; the CPU is allocated to the process with highest priority. Priorities are represented by numbers, with low numbers being highest priority. Can priority scheduling be preemptive? YES, NO REASON WHY NOT. What s the relation of SJF scheduling to priority scheduling? SJF IS A TYPE OF PRIORITY SCHEDULING. (SPECIFICALLY, ONE WHERE THE PRIORITY OF A PROCESS IS SET TO BE THE ESTIMATED NEXT CPU BURST. (IF LOW NUMBERS ARE ASSUMED TO DENOTE HIGH PRIORITIES.) Zhiyi Huang (Otago) COSC243 Lecture / 30
24 Starvation and Aging Starvation occurs when a process waits indefinitely to be allocated the CPU. Priority scheduling algorithms are susceptible to starvation. Imagine a process P1 is waiting for the CPU, and a stream of higher-priority processes is arriving. If these processes arrive sufficiently fast, P1 will never get a chance to execute. A solution to the starvation problem is to increase the priority of processes as a function of how long they ve been waiting for the CPU. (Called aging.) Zhiyi Huang (Otago) COSC243 Lecture / 30
25 4) Round-Robin Scheduling Round-robin (RR) scheduling is designed for time-sharing systems. A small unit of time (time quantum) is defined. The ready queue is treated as a circular list. The CPU scheduler goes round the ready queue, allocating the CPU to each process for a time interval of up to 1 time quantum. head process ID number pointer process state process ID number pointer process state process ID number pointer process state program counter program counter program counter tail Contents of CPU registers memory management information I/O status information Contents of CPU registers memory management information I/O status information Contents of CPU registers memory management information I/O status information Accounting information Accounting information Accounting information CPU I/O operation? Time quantum expired? Zhiyi Huang (Otago) COSC243 Lecture / 30
26 An example of Round-Robin Say we have an RR algorithm with a quantum of 3, and the following process info: The Gantt chart will look like this: Process Arrival Time Burst Time P1 0 8 P2 1 4 P3 4 4 P2=0 P3=0 P1=5 P2=1 P1=2 P3=1 P1=0 P1 P2 P1 P3 P2 P1 P Note: in RR it s possible that a process re-enters the ready queue at the same time that another process arrives in the queue. We ll use FCFS as a tie-breaker here too. Zhiyi Huang (Otago) COSC243 Lecture / 30
27 Changing the Time Quantum in RR Scheduling If the time quantum is set to be infinitely large: RR scheduling reduces to FCFS scheduing. If the time quantum is set to be very small: we can talk of processor sharing. However, there are drawbacks to making the time quantum very small. Let s say we make the time quantum the same as the context switch time. Then we ll spend half our time on context switching! Zhiyi Huang (Otago) COSC243 Lecture / 30
28 RR: Advantages and Disadvantages IT ALL DEPENDS ON THE SIZE OF THE TIME QUANTUM. IF IT S BIG, WE GET THE ADVANTAGES/DISADVANTAGES OF FCFS SCHEDULING. IF IT S VERY SMALL, WE GET FASTER RESPONSE TIME. BUT SLOWER THROUGHPUT. (WHY? BECAUSE THERE S MORE TIME SPENT CONTEXT-SWITCHING.) EVEN IF YOU IGNORE CONTEXT-SWITCH TIME, TURNAROUND TIME GOES DOWN IF MOST PROCESSES COMPLETE WITHIN A SINGLE QUANTUM. FOR INSTANCE, SAY THERE ARE 3 PROCESSES WITH A NEXT CPU BURST OF 10. IF THE QUANTUM SIZE IS 1, THEN AVERAGE TURNAROUND TIME IS 29. BUT IF QUANTUM SIZE IS 10, THEN THEY DO FINISH IN THE NEXT CPU BURST, AND THE AVERAGE TURNAROUND TIME IS 20. IF WE TAKE CONTEXT-SWITCH TIME INTO ACCOUNT, MAKING THE TIME QUANTUM SMALL ALSO HAS THE EFFECT OF INCREASING TURNAROUND TIME. Zhiyi Huang (Otago) COSC243 Lecture / 30
29 5) Multilevel Queue Scheduling Let s say you have two groups of processes: interactive processes; batch processes. What you really want is to run different scheduling algorithms for the two different groups. Multilevel queue scheduling: Split the ready queue into a number of different queues, each with its own scheduling algorithm. Implement a scheduling algorithm to decide which queue is next allocated. (Preemptive priority scheduling is often used.) Zhiyi Huang (Otago) COSC243 Lecture / 30
30 Exercises For this lecture, you should have read Chapter 5 (Sections 1, 2, 3 and 7) of Silberschatz et al. For next lecture: 1 Read Chapter 6 (Sections 1 7). 2 The Unix command nice can be used to run processes at different priorities. Read the man page for nice. Using one of the programs you have written on UNIX, try the following: /bin/nice -n 19 [program] /bin/nice -n 10 [program] Notice any difference in speed? Zhiyi Huang (Otago) COSC243 Lecture / 30
Chapter 5: CPU Scheduling
Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating Systems Examples Algorithm Evaluation Chapter 5: CPU Scheduling
More informationLecture 5 / Chapter 6 (CPU Scheduling) Basic Concepts. Scheduling Criteria Scheduling Algorithms
Operating System Lecture 5 / Chapter 6 (CPU Scheduling) Basic Concepts Scheduling Criteria Scheduling Algorithms OS Process Review Multicore Programming Multithreading Models Thread Libraries Implicit
More informationOperating System Concepts Ch. 5: Scheduling
Operating System Concepts Ch. 5: Scheduling Silberschatz, Galvin & Gagne Scheduling In a multi-programmed system, multiple processes may be loaded into memory at the same time. We need a procedure, or
More informationCPU Scheduling Algorithms
CPU Scheduling Algorithms Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating Systems Concepts with Java, by Silberschatz, Galvin, and Gagne (2007).
More informationCS370: System Architecture & Software [Fall 2014] Dept. Of Computer Science, Colorado State University
Frequently asked questions from the previous class survey CS 370: SYSTEM ARCHITECTURE & SOFTWARE [CPU SCHEDULING] Shrideep Pallickara Computer Science Colorado State University OpenMP compiler directives
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 9 Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 CPU Scheduling: Objectives CPU scheduling,
More informationCh 4 : CPU scheduling
Ch 4 : CPU scheduling It's the basis of multiprogramming operating systems. By switching the CPU among processes, the operating system can make the computer more productive In a single-processor system,
More informationLECTURE 3:CPU SCHEDULING
LECTURE 3:CPU SCHEDULING 1 Outline Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time CPU Scheduling Operating Systems Examples Algorithm Evaluation 2 Objectives
More informationCPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou ( Zhejiang University
Operating Systems (Fall/Winter 2018) CPU Scheduling Yajin Zhou (http://yajin.org) Zhejiang University Acknowledgement: some pages are based on the slides from Zhi Wang(fsu). Review Motivation to use threads
More informationOPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5
OPERATING SYSTEMS CS3502 Spring 2018 Processor Scheduling Chapter 5 Goals of Processor Scheduling Scheduling is the sharing of the CPU among the processes in the ready queue The critical activities are:
More informationSo far. Next: scheduling next process from Wait to Run. 1/31/08 CSE 30341: Operating Systems Principles
So far. Firmware identifies hardware devices present OS bootstrap process: uses the list created by firmware and loads driver modules for each detected hardware. Initializes internal data structures (PCB,
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 10 Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Chapter 6: CPU Scheduling Basic Concepts
More informationCPU Scheduling. CSE 2431: Introduction to Operating Systems Reading: Chapter 6, [OSC] (except Sections )
CPU Scheduling CSE 2431: Introduction to Operating Systems Reading: Chapter 6, [OSC] (except Sections 6.7.2 6.8) 1 Contents Why Scheduling? Basic Concepts of Scheduling Scheduling Criteria A Basic Scheduling
More informationCPU Scheduling (1) CPU Scheduling (Topic 3) CPU Scheduling (2) CPU Scheduling (3) Resources fall into two classes:
CPU Scheduling (Topic 3) 홍성수 서울대학교공과대학전기공학부 Real-Time Operating Systems Laboratory CPU Scheduling (1) Resources fall into two classes: Preemptible: Can take resource away, use it for something else, then
More informationChapter 5: CPU Scheduling
COP 4610: Introduction to Operating Systems (Fall 2016) Chapter 5: CPU Scheduling Zhi Wang Florida State University Contents Basic concepts Scheduling criteria Scheduling algorithms Thread scheduling Multiple-processor
More informationChapter 6: CPU Scheduling. Operating System Concepts 9 th Edition
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time
More informationChapter 6: CPU Scheduling. Operating System Concepts 9 th Edition
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time
More informationProperties of Processes
CPU Scheduling Properties of Processes CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait. CPU burst distribution: CPU Scheduler Selects from among the processes that
More informationALL the assignments (A1, A2, A3) and Projects (P0, P1, P2) we have done so far.
Midterm Exam Reviews ALL the assignments (A1, A2, A3) and Projects (P0, P1, P2) we have done so far. Particular attentions on the following: System call, system kernel Thread/process, thread vs process
More informationCPU scheduling. Alternating sequence of CPU and I/O bursts. P a g e 31
CPU scheduling CPU scheduling is the basis of multiprogrammed operating systems. By switching the CPU among processes, the operating system can make the computer more productive. In a single-processor
More informationCPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013)
CPU Scheduling Daniel Mosse (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013) Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU I/O Burst Cycle Process
More informationChapter 5 CPU scheduling
Chapter 5 CPU scheduling Contents Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples Java Thread Scheduling
More informationCHAPTER 2: PROCESS MANAGEMENT
1 CHAPTER 2: PROCESS MANAGEMENT Slides by: Ms. Shree Jaswal TOPICS TO BE COVERED Process description: Process, Process States, Process Control Block (PCB), Threads, Thread management. Process Scheduling:
More informationAssignment 3 (Due date: Thursday, 10/15/2009, in class) Part One: Provide brief answers to the following Chapter Exercises questions:
Assignment 3 (Due date: Thursday, 10/15/2009, in class) Your name: Date: Part One: Provide brief answers to the following Chapter Exercises questions: 4.7 Provide two programming examples in which multithreading
More informationCPU Scheduling. Rab Nawaz Jadoon. Assistant Professor DCS. Pakistan. COMSATS, Lahore. Department of Computer Science
CPU Scheduling Rab Nawaz Jadoon DCS COMSATS Institute of Information Technology Assistant Professor COMSATS, Lahore Pakistan Operating System Concepts Objectives To introduce CPU scheduling, which is the
More informationProcesses. CS 475, Spring 2018 Concurrent & Distributed Systems
Processes CS 475, Spring 2018 Concurrent & Distributed Systems Review: Abstractions 2 Review: Concurrency & Parallelism 4 different things: T1 T2 T3 T4 Concurrency: (1 processor) Time T1 T2 T3 T4 T1 T1
More informationChap 7, 8: Scheduling. Dongkun Shin, SKKU
Chap 7, 8: Scheduling 1 Introduction Multiprogramming Multiple processes in the system with one or more processors Increases processor utilization by organizing processes so that the processor always has
More informationScheduling of processes
Scheduling of processes Processor scheduling Schedule processes on the processor to meet system objectives System objectives: Assigned processes to be executed by the processor Response time Throughput
More informationOperating Systems Unit 3
Unit 3 CPU Scheduling Algorithms Structure 3.1 Introduction Objectives 3.2 Basic Concepts of Scheduling. CPU-I/O Burst Cycle. CPU Scheduler. Preemptive/non preemptive scheduling. Dispatcher Scheduling
More informationOperating Systems. Scheduling
Operating Systems Scheduling Process States Blocking operation Running Exit Terminated (initiate I/O, down on semaphore, etc.) Waiting Preempted Picked by scheduler Event arrived (I/O complete, semaphore
More informationPreview. Process Scheduler. Process Scheduling Algorithms for Batch System. Process Scheduling Algorithms for Interactive System
Preview Process Scheduler Short Term Scheduler Long Term Scheduler Process Scheduling Algorithms for Batch System First Come First Serve Shortest Job First Shortest Remaining Job First Process Scheduling
More informationCPU Scheduling: Part I ( 5, SGG) Operating Systems. Autumn CS4023
Operating Systems Autumn 2017-2018 Outline 1 CPU Scheduling: Part I ( 5, SGG) Outline CPU Scheduling: Part I ( 5, SGG) 1 CPU Scheduling: Part I ( 5, SGG) Basic Concepts Typical program behaviour CPU Scheduling:
More information1.1 CPU I/O Burst Cycle
PROCESS SCHEDULING ALGORITHMS As discussed earlier, in multiprogramming systems, there are many processes in the memory simultaneously. In these systems there may be one or more processors (CPUs) but the
More informationLast class: Today: CPU Scheduling. CPU Scheduling Algorithms and Systems
1 Last class: CPU Scheduling Today: CPU Scheduling Algorithms and Systems 2 Scheduling Algorithms First-come, First-serve (FCFS) Non-preemptive Does not account for waiting time (or much else) Convoy problem
More informationCPU Scheduling. Basic Concepts. Histogram of CPU-burst Times. Dispatcher. CPU Scheduler. Alternating Sequence of CPU and I/O Bursts
CS307 Basic Concepts Maximize CPU utilization obtained with multiprogramming CPU Scheduling CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait CPU burst distribution
More informationCPU Scheduling: Objectives
CPU Scheduling: Objectives CPU scheduling, the basis for multiprogrammed operating systems CPU-scheduling algorithms Evaluation criteria for selecting a CPU-scheduling algorithm for a particular system
More informationLast Class: Processes
Last Class: Processes A process is the unit of execution. Processes are represented as Process Control Blocks in the OS PCBs contain process state, scheduling and memory management information, etc A process
More informationPractice Exercises 305
Practice Exercises 305 The FCFS algorithm is nonpreemptive; the RR algorithm is preemptive. The SJF and priority algorithms may be either preemptive or nonpreemptive. Multilevel queue algorithms allow
More informationCourse Syllabus. Operating Systems
Course Syllabus. Introduction - History; Views; Concepts; Structure 2. Process Management - Processes; State + Resources; Threads; Unix implementation of Processes 3. Scheduling Paradigms; Unix; Modeling
More informationOperating Systems ECE344. Ding Yuan
Operating Systems ECE344 Ding Yuan Announcement & Reminder Midterm exam Will grade them this Friday Will post the solution online before next lecture Will briefly go over the common mistakes next Monday
More informationUnit 3 : Process Management
Unit : Process Management Processes are the most widely used units of computation in programming and systems, although object and threads are becoming more prominent in contemporary systems. Process management
More informationCSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Scheduling
CSE120 Principles of Operating Systems Prof Yuanyuan (YY) Zhou Scheduling Announcement l Homework 2 due on October 26th l Project 1 due on October 27th 2 Scheduling Overview l In discussing process management
More informationLecture 17: Threads and Scheduling. Thursday, 05 Nov 2009
CS211: Programming and Operating Systems Lecture 17: Threads and Scheduling Thursday, 05 Nov 2009 CS211 Lecture 17: Threads and Scheduling 1/22 Today 1 Introduction to threads Advantages of threads 2 User
More informationCS3733: Operating Systems
CS3733: Operating Systems Topics: Process (CPU) Scheduling (SGG 5.1-5.3, 6.7 and web notes) Instructor: Dr. Dakai Zhu 1 Updates and Q&A Homework-02: late submission allowed until Friday!! Submit on Blackboard
More informationProcess Scheduling. Copyright : University of Illinois CS 241 Staff
Process Scheduling Copyright : University of Illinois CS 241 Staff 1 Process Scheduling Deciding which process/thread should occupy the resource (CPU, disk, etc) CPU I want to play Whose turn is it? Process
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples Java Thread Scheduling
More informationFrequently asked questions from the previous class survey
CS 370: OPERATING SYSTEMS [CPU SCHEDULING] Shrideep Pallickara Computer Science Colorado State University L14.1 Frequently asked questions from the previous class survey Turnstiles: Queue for threads blocked
More informationIntroduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras
Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras Week 05 Lecture 18 CPU Scheduling Hello. In this lecture, we
More informationCPU Scheduling. Schedulers. CPSC 313: Intro to Computer Systems. Intro to Scheduling. Schedulers in the OS
Schedulers in the OS Scheduling Structure of a Scheduler Scheduling = Selection + Dispatching Criteria for scheduling Scheduling Algorithms FIFO/FCFS SPF / SRTF Priority - Based Schedulers start long-term
More informationCS 326: Operating Systems. CPU Scheduling. Lecture 6
CS 326: Operating Systems CPU Scheduling Lecture 6 Today s Schedule Agenda? Context Switches and Interrupts Basic Scheduling Algorithms Scheduling with I/O Symmetric multiprocessing 2/7/18 CS 326: Operating
More informationLecture 2 Process Management
Lecture 2 Process Management Process Concept An operating system executes a variety of programs: Batch system jobs Time-shared systems user programs or tasks The terms job and process may be interchangeable
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 Lecture 8 Threads and Scheduling Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ How many threads
More informationOPERATING SYSTEMS. UNIT II Sections A, B & D. An operating system executes a variety of programs:
OPERATING SYSTEMS UNIT II Sections A, B & D PREPARED BY ANIL KUMAR PRATHIPATI, ASST. PROF., DEPARTMENT OF CSE. PROCESS CONCEPT An operating system executes a variety of programs: Batch system jobs Time-shared
More informationAnnouncements. Program #1. Program #0. Reading. Is due at 9:00 AM on Thursday. Re-grade requests are due by Monday at 11:59:59 PM.
Program #1 Announcements Is due at 9:00 AM on Thursday Program #0 Re-grade requests are due by Monday at 11:59:59 PM Reading Chapter 6 1 CPU Scheduling Manage CPU to achieve several objectives: maximize
More informationProcess- Concept &Process Scheduling OPERATING SYSTEMS
OPERATING SYSTEMS Prescribed Text Book Operating System Principles, Seventh Edition By Abraham Silberschatz, Peter Baer Galvin and Greg Gagne PROCESS MANAGEMENT Current day computer systems allow multiple
More informationReview. Preview. Three Level Scheduler. Scheduler. Process behavior. Effective CPU Scheduler is essential. Process Scheduling
Review Preview Mutual Exclusion Solutions with Busy Waiting Test and Set Lock Priority Inversion problem with busy waiting Mutual Exclusion with Sleep and Wakeup The Producer-Consumer Problem Race Condition
More informationChapter 9. Uniprocessor Scheduling
Operating System Chapter 9. Uniprocessor Scheduling Lynn Choi School of Electrical Engineering Scheduling Processor Scheduling Assign system resource (CPU time, IO device, etc.) to processes/threads to
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2019 Lecture 8 Scheduling Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ POSIX: Portable Operating
More information8: Scheduling. Scheduling. Mark Handley
8: Scheduling Mark Handley Scheduling On a multiprocessing system, more than one process may be available to run. The task of deciding which process to run next is called scheduling, and is performed by
More informationOperating Systems. Process scheduling. Thomas Ropars.
1 Operating Systems Process scheduling Thomas Ropars thomas.ropars@univ-grenoble-alpes.fr 2018 References The content of these lectures is inspired by: The lecture notes of Renaud Lachaize. The lecture
More informationUniprocessor Scheduling. Aim of Scheduling
Uniprocessor Scheduling Chapter 9 Aim of Scheduling Response time Throughput Processor efficiency Types of Scheduling Long-Term Scheduling Determines which programs are admitted to the system for processing
More informationUniprocessor Scheduling. Aim of Scheduling. Types of Scheduling. Long-Term Scheduling. Chapter 9. Response time Throughput Processor efficiency
Uniprocessor Scheduling Chapter 9 Aim of Scheduling Response time Throughput Processor efficiency Types of Scheduling Long-Term Scheduling Determines which programs are admitted to the system for processing
More informationCS307: Operating Systems
CS307: Operating Systems Chentao Wu 吴晨涛 Associate Professor Dept. of Computer Science and Engineering Shanghai Jiao Tong University SEIEE Building 3-513 wuct@cs.sjtu.edu.cn Download Lectures ftp://public.sjtu.edu.cn
More informationStart of Lecture: February 10, Chapter 6: Scheduling
Start of Lecture: February 10, 2014 1 Reminders Exercise 2 due this Wednesday before class Any questions or comments? 2 Scheduling so far First-Come-First Serve FIFO scheduling in queue without preempting
More informationChapter 5: CPU Scheduling. Operating System Concepts Essentials 8 th Edition
Chapter 5: CPU Scheduling Silberschatz, Galvin and Gagne 2011 Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating
More informationCSE 120 Principles of Operating Systems Spring 2017
CSE 120 Principles of Operating Systems Spring 2017 Lecture 5: Scheduling Administrivia Homework #1 due tomorrow Homework #2 out tomorrow October 20, 2015 CSE 120 Lecture 8 Scheduling and Deadlock 2 Scheduling
More informationOperating Systems. Lecture Process Scheduling. Golestan University. Hossein Momeni
Operating Systems Lecture 2.2 - Process Scheduling Golestan University Hossein Momeni momeni@iust.ac.ir Scheduling What is scheduling? Goals Mechanisms Scheduling on batch systems Scheduling on interactive
More information3. CPU Scheduling. Operating System Concepts with Java 8th Edition Silberschatz, Galvin and Gagn
3. CPU Scheduling Operating System Concepts with Java 8th Edition Silberschatz, Galvin and Gagn S P O I L E R operating system CPU Scheduling 3 operating system CPU Scheduling 4 Long-short-medium Scheduler
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne Histogram of CPU-burst Times 6.2 Silberschatz, Galvin and Gagne Alternating Sequence of CPU And I/O Bursts 6.3 Silberschatz, Galvin and Gagne CPU
More informationScheduling. The Basics
The Basics refers to a set of policies and mechanisms to control the order of work to be performed by a computer system. Of all the resources in a computer system that are scheduled before use, the CPU
More informationA COMPARATIVE STUDY OF CPU SCHEDULING POLICIES IN OPERATING SYSTEMS
VSRD International Journal of Computer Science &Information Technology, Vol. IV Issue VII July 2014 / 119 e-issn : 2231-2471, p-issn : 2319-2224 VSRD International Journals : www.vsrdjournals.com REVIEW
More informationCSE 4/521 Introduction to Operating Systems
CSE 4/521 Introduction to Operating Systems Lecture 9 CPU Scheduling II (Scheduling Algorithms, Thread Scheduling, Real-time CPU Scheduling) Summer 2018 Overview Objective: 1. To describe priority scheduling
More informationChapter 9 Uniprocessor Scheduling
Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 9 Uniprocessor Scheduling Patricia Roy Manatee Community College, Venice, FL 2008, Prentice Hall Aim of Scheduling Assign
More informationOperating Systems. Figure: Process States. 1 P a g e
1. THE PROCESS CONCEPT A. The Process: A process is a program in execution. A process is more than the program code, which is sometimes known as the text section. It also includes the current activity,
More informationLecture Topics. Announcements. Today: Uniprocessor Scheduling (Stallings, chapter ) Next: Advanced Scheduling (Stallings, chapter
Lecture Topics Today: Uniprocessor Scheduling (Stallings, chapter 9.1-9.3) Next: Advanced Scheduling (Stallings, chapter 10.1-10.4) 1 Announcements Self-Study Exercise #10 Project #8 (due 11/16) Project
More informationTDIU25: Operating Systems II. Processes, Threads and Scheduling
TDIU25: Operating Systems II. Processes, Threads and Scheduling SGG9: 3.1-3.3, 4.1-4.3, 5.1-5.4 o Process concept: context switch, scheduling queues, creation o Multithreaded programming o Process scheduling
More informationChapter 5: CPU Scheduling
Chapter 5: CPU Scheduling Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating Systems Examples Algorithm Evaluation
More informationChapter 5: CPU Scheduling. Operating System Concepts 8 th Edition,
Chapter 5: CPU Scheduling Operating System Concepts 8 th Edition, Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2009 Chapter 5: Process Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms
More informationFrequently asked questions from the previous class survey
CS 370: OPERATING SYSTEMS [CPU SCHEDULING] Shrideep Pallickara Computer Science Colorado State University L15.1 Frequently asked questions from the previous class survey Could we record burst times in
More informationOperating Systems Comprehensive Exam. Spring Student ID # 3/16/2006
Operating Systems Comprehensive Exam Spring 2006 Student ID # 3/16/2006 You must complete all of part I (60%) You must complete two of the three sections in part II (20% each) In Part I, circle or select
More informationComp 310 Computer Systems and Organization
Comp 310 Computer Systems and Organization Lecture #9 Process Management (CPU Scheduling) 1 Prof. Joseph Vybihal Announcements Oct 16 Midterm exam (in class) In class review Oct 14 (½ class review) Ass#2
More informationCSC Operating Systems Spring Lecture - XII Midterm Review. Tevfik Ko!ar. Louisiana State University. March 4 th, 2008.
CSC 4103 - Operating Systems Spring 2008 Lecture - XII Midterm Review Tevfik Ko!ar Louisiana State University March 4 th, 2008 1 I/O Structure After I/O starts, control returns to user program only upon
More informationUniprocessor Scheduling. Chapter 9
Uniprocessor Scheduling Chapter 9 1 Aim of Scheduling Assign processes to be executed by the processor(s) Response time Throughput Processor efficiency 2 3 4 Long-Term Scheduling Determines which programs
More informationUniprocessor Scheduling
Uniprocessor Scheduling Chapter 9 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice, FL 2008, Prentice Hall CPU- and I/O-bound processes
More informationScheduling. Multi-processing. Process Characterization. time. ...makes use of idle. COS450-F18-05-Scheduling - October 8, 2018
1 Scheduling Process Management COS 450 - Fall 2018 Process Characterization 2 Px - 10µS CPU IO CPU IO CPU IO CPU IO CPU CPU IO CPU IO CPU IO CPU...mix...many of processing of these are and in the idle
More informationScheduling Mar. 19, 2018
15-410...Everything old is new again... Scheduling Mar. 19, 2018 Dave Eckhardt Brian Railing Roger Dannenberg 1 Outline Chapter 5 (or Chapter 7): Scheduling Scheduling-people/textbook terminology note
More informationSample Questions. Amir H. Payberah. Amirkabir University of Technology (Tehran Polytechnic)
Sample Questions Amir H. Payberah amir@sics.se Amirkabir University of Technology (Tehran Polytechnic) Amir H. Payberah (Tehran Polytechnic) Sample Questions 1393/8/10 1 / 29 Question 1 Suppose a thread
More informationOPERATING SYSTEMS. After A.S.Tanenbaum, Modern Operating Systems, 3rd edition. Uses content with permission from Assoc. Prof. Florin Fortis, PhD
OPERATING SYSTEMS #5 After A.S.Tanenbaum, Modern Operating Systems, 3rd edition Uses content with permission from Assoc. Prof. Florin Fortis, PhD General information GENERAL INFORMATION Cooperating processes
More informationTitolo presentazione. Scheduling. sottotitolo A.Y Milano, XX mese 20XX ACSO Tutoring MSc Eng. Michele Zanella
Titolo presentazione Scheduling sottotitolo A.Y. 2017-18 Milano, XX mese 20XX ACSO Tutoring MSc Eng. Michele Zanella Process Scheduling Goals: Multiprogramming: having some process running at all times,
More informationScheduling. Scheduling. Scheduling. Scheduling Criteria. Priorities. Scheduling
scheduling: share CPU among processes scheduling should: be fair all processes must be similarly affected no indefinite postponement aging as a possible solution adjust priorities based on waiting time
More informationFCM 710: Architecture of Secure Operating Systems
FCM 710: Architecture of Secure Operating Systems Practice Exam, Spring 2010 Email your answer to ssengupta@jjay.cuny.edu March 16, 2010 Instructor: Shamik Sengupta Multiple-Choice 1. operating systems
More informationChapter 5: Process Scheduling
Chapter 5: Process Scheduling Chapter 5: Process Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Thread Scheduling Operating Systems Examples Algorithm
More informationOperating Systems CS 323 Ms. Ines Abbes
Taibah University College of Community of Badr Computer Science Department Operating Systems CS71/CS72 جامعة طيبة كلية المجتمع ببدر قسم علوم الحاسب مقرر: نظم التشغيل Operating Systems CS 323 Ms. Ines Abbes
More informationOPERATING SYSTEMS: Lesson 4: Process Scheduling
OPERATING SYSTEMS: Lesson 4: Process Scheduling Jesús Carretero Pérez David Expósito Singh José Daniel García Sánchez Francisco Javier García Blas Florin Isaila 1 Content Process creation. Process termination.
More informationUniprocessor Scheduling. Basic Concepts Scheduling Criteria Scheduling Algorithms. Three level scheduling
Uniprocessor Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Three level scheduling 2 1 Types of Scheduling 3 Long- and Medium-Term Schedulers Long-term scheduler Determines which programs
More informationOperating Systems Comprehensive Exam. Spring Student ID # 3/20/2013
Operating Systems Comprehensive Exam Spring 2013 Student ID # 3/20/2013 You must complete all of Section I You must complete two of the problems in Section II If you need more space to answer a question,
More informationCS418 Operating Systems
CS418 Operating Systems Lecture 9 Processor Management, part 1 Textbook: Operating Systems by William Stallings 1 1. Basic Concepts Processor is also called CPU (Central Processing Unit). Process an executable
More informationScheduling. Today. Next Time Process interaction & communication
Scheduling Today Introduction to scheduling Classical algorithms Thread scheduling Evaluating scheduling OS example Next Time Process interaction & communication Scheduling Problem Several ready processes
More informationCPU Scheduling. The scheduling problem: When do we make decision? - Have K jobs ready to run - Have N 1 CPUs - Which jobs to assign to which CPU(s)
CPU Scheduling The scheduling problem: - Have K jobs ready to run - Have N 1 CPUs - Which jobs to assign to which CPU(s) When do we make decision? 1 / 31 CPU Scheduling new admitted interrupt exit terminated
More informationby Maria Lima Term Paper for Professor Barrymore Warren Mercy College Division of Mathematics and Computer Information Science
by Maria Lima Term Paper for Professor Barrymore Warren Mercy College Division of Mathematics and Computer Information Science Table of Contents 1. Introduction...1 2. CPU Scheduling Overview...1 3. Processes
More information