CPSC 457 Operating Systems

Slides:



Advertisements
Similar presentations
G53OPS Operating Systems Graham Kendall Q Exam.
Advertisements

Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 17 Scheduling III.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 5: CPU Scheduling.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 16 Scheduling II.
Exercise (5).
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 5: CPU Scheduling.
Chapter 5-CPU Scheduling
Chapter 6: CPU Scheduling
Alternating Sequence of CPU And I/O Bursts. Histogram of CPU-burst Times.
Scanf n, a, b /* I-O wait */ for (i=1; i
Lecture Topics: 11/15 CPU scheduling: –Scheduling goals and algorithms.
CPU Scheduling Operating Systems CS 550. Last Time Deadlock Detection and Recovery Methods to handle deadlock – Ignore it! – Detect and Recover – Avoidance.
1 Module 5: Scheduling CPU Scheduling Scheduling Algorithms Reading: Chapter
Lecture 5 Scheduling. Today CPSC Tyson Kendon Updates Assignment 1 Assignment 2 Concept Review Scheduling Processes Concepts Algorithms.
Lecturer 5: Process Scheduling Process Scheduling  Criteria & Objectives Types of Scheduling  Long term  Medium term  Short term CPU Scheduling Algorithms.
CPU Scheduling Algorithms CSSE 332 Operating Systems Rose-Hulman Institute of Technology.
1 Chapter 5: CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms.
Lecture 6 The Rest of Scheduling Algorithms and The Beginning of Memory Management.
Chapter 6: CPU Scheduling
Dan C. Marinescu Office: HEC 439 B. Office hours: M, Wd 3 – 4:30 PM.
Chapter 5a: CPU Scheduling
CPU Scheduling Algorithms
CPU scheduling 6. Schedulers, CPU Scheduling 6.1. Schedulers
Process Scheduling B.Ramamurthy 9/16/2018.
Scheduling (Priority Based)
CPU Scheduling.
Chapter 6: CPU Scheduling
Chapter 6: CPU Scheduling
Lecture 23: Process Scheduling for Interactive Systems
ICS 143 Principles of Operating Systems
Chapter 5: CPU Scheduling
CS 143A - Principles of Operating Systems
Process Scheduling B.Ramamurthy 11/18/2018.
CPU Scheduling Basic Concepts Scheduling Criteria
CPU Scheduling G.Anuradha
Chapter 6: CPU Scheduling
Lecture 16 Syed Mansoor Sarwar
Module 5: CPU Scheduling
Operating Systems Lecture 15.
Operating System Concepts
3: CPU Scheduling Basic Concepts Scheduling Criteria
Process Scheduling B.Ramamurthy 12/5/2018.
Chapter5: CPU Scheduling
TDC 311 Process Scheduling.
COT 4600 Operating Systems Spring 2011
Chapter 5: CPU Scheduling
Chapter 6: CPU Scheduling
Outline Scheduling algorithms Multi-processor scheduling
Operating System Concepts
Exercise Ms.Reema alOraini
CGS 3763 Operating Systems Concepts Spring 2013
Chapter 5: CPU Scheduling
Lecture 2 Part 3 CPU Scheduling
Process Scheduling B.Ramamurthy 2/23/2019.
Process Scheduling B.Ramamurthy 2/23/2019.
Process Scheduling B.Ramamurthy 2/23/2019.
Process Scheduling B.Ramamurthy 4/11/2019.
Process Scheduling B.Ramamurthy 4/7/2019.
Process Scheduling B.Ramamurthy 4/19/2019.
Process Scheduling B.Ramamurthy 4/24/2019.
Shortest-Job-First (SJR) Scheduling
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Process Scheduling B.Ramamurthy 5/7/2019.
CPU SCHEDULING CPU SCHEDULING.
Chapter 6: CPU Scheduling
CPU Scheduling.
CPU Scheduling: Basic Concepts
Module 5: CPU Scheduling
Chapter 5: CPU Scheduling
Presentation transcript:

CPSC 457 Operating Systems Midterm Review: Practical Questions

Q1 Describe the steps that occur when a user program to executes a system call (assuming that there is a system library to wrap the call). CPSC 457 - Tyson Kendon 2016

Q2 Describe the steps that occur when the operating system performs a context switch between processes. CPSC 457 - Tyson Kendon 2016

Q3 Consider the following table of process, all of which are available at the time of scheduling and arrived in the order in which they are numbered , with the given burst times and priorities (lower numbers are higher priority). Process Burst Time Priority P1 8ms 2 P2 4ms 1 P3 10ms P4 2ms P5 CPSC 457 - Tyson Kendon 2016

Q3 Draw the Gantt chart and calculate the average turnaround time for the following algorithms. 3a) First Come, First Served 3b) Shortest Job First 3c) Priority 3d) Round Robin (with a 5ms time quantum) CPSC 457 - Tyson Kendon 2016

Q4 Consider the following table of process, with the given burst and arrival times Process Burst Time Arrival Time P1 8ms 0 ms P2 4ms 4 ms P3 10ms 6 ms P4 2ms 12 ms P5 18 ms CPSC 457 - Tyson Kendon 2016

4a) Shortest Job First (Non-Preemptive) Draw the Gantt chart and calculate the average turnaround time for the following algorithms. 4a) Shortest Job First (Non-Preemptive) 4b) Shortest Job First (Preemptive) 4c) Round Robin (with a 5ms time quantum) 4d) A Multi-Level Feedback Queue with 3 queues, a high priority queue served with Round Robin with a a 2 ms quantum, a medium priority queue served with Round Robin with a a 6 ms quantum, a low priority queue served First Come First Served. a job is preempted if a higher priority job is available. A preempted job is put on the HEAD of its queue. CPSC 457 - Tyson Kendon 2016

Q5 5) Recall the formula calculating exponential average: ♣️n+1 = ♥️tn + (1 - ♥️) ♣️n For a process with the following real burst times, an initial estimated burst time of (4 ms) and a memory factor () of .5 calculate estimated burst times for each n. (Round to the nearest integer ms)   1 2 3 4 Estimated Burst 5ms Real Burst 10ms 2ms 8ms 3ms 12ms CPSC 457 - Tyson Kendon 2016