Sarah Diesburg Operating Systems CS 3430

Slides:



Advertisements
Similar presentations
1 Interprocess Communication 1. Ways of passing information 2. Guarded critical activities (e.g. updating shared data) 3. Proper sequencing in case of.
Advertisements

CAS3SH3 Midterm Review. The midterm 50 min, Friday, Feb 27 th Materials through CPU scheduling closed book, closed note Types of questions: True & False,
Chapter 6: Process Synchronization
Process Synchronization. Module 6: Process Synchronization Background The Critical-Section Problem Peterson’s Solution Synchronization Hardware Semaphores.
Cpr E 308 Spring 2004 Recap for Midterm Introductory Material What belongs in the OS, what doesn’t? Basic Understanding of Hardware, Memory Hierarchy.
Concurrency: Threads, Address Spaces, and Processes Sarah Diesburg Operating Systems COP 4610.
Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
Review: Chapters 1 – Chapter 1: OS is a layer between user and hardware to make life easier for user and use hardware efficiently Control program.
CS 311 – Lecture 23 Outline Kernel – Process subsystem Process scheduling Scheduling algorithms User mode and kernel mode Lecture 231CS Operating.
1 School of Computing Science Simon Fraser University CMPT 300: Operating Systems I Dr. Mohamed Hefeeda.
Avishai Wool lecture Priority Scheduling Idea: Jobs are assigned priorities. Always, the job with the highest priority runs. Note: All scheduling.
CMPT 300: Operating Systems Review THIS REIVEW SHOULD NOT BE USED AS PREDICTORS OF THE ACTUAL QUESTIONS APPEARING ON THE FINAL EXAM.
Process Concept An operating system executes a variety of programs
Race Conditions CS550 Operating Systems. Review So far, we have discussed Processes and Threads and talked about multithreading and MPI processes by example.
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.
CSC 360- Instructor: K. Wu CPU Scheduling. CSC 360- Instructor: K. Wu Agenda 1.What is CPU scheduling? 2.CPU burst distribution 3.CPU scheduler and dispatcher.
CS 153 Design of Operating Systems Spring 2015 Midterm Review.
CS 153 Design of Operating Systems Spring 2015 Lecture 11: Scheduling & Deadlock.
Cpr E 308 Spring 2004 Real-time Scheduling Provide time guarantees Upper bound on response times –Programmer’s job! –Every level of the system Soft versus.
Chapter 1 Computer System Overview Sections 1.1 to 1.6 Instruction exe cution Interrupt Memory hierarchy Cache memory Locality: spatial and temporal Problem.
Operating Systems CSE 411 Multi-processor Operating Systems Multi-processor Operating Systems Dec Lecture 30 Instructor: Bhuvan Urgaonkar.
30 October Agenda for Today Introduction and purpose of the course Introduction and purpose of the course Organization of a computer system Organization.
Chapter 5 Processor Scheduling Introduction Processor (CPU) scheduling is the sharing of the processor(s) among the processes in the ready queue.
Exam Review Andy Wang Operating Systems COP 4610 / CGS 5765.
Silberschatz and Galvin  Chapter 3:Processes Processes –State of a process, process control block, –Scheduling of processes  Long term scheduler,
CSE 153 Design of Operating Systems Winter 2015 Midterm Review.
1/31/20161 Final Exam Dec 10. Monday. 4-7pm. Phelp 1160 Similar to midterm The exam is closed book. You can bring 2 page of notes (double sided) Nachos.
What is an Operating System? Various systems and their pros and cons –E.g. multi-tasking vs. Batch OS definitions –Resource allocator –Control program.
CE Operating Systems Lecture 8 Process Scheduling continued and an introduction to process synchronisation.
CMPT 300: Operating Systems Course Summary THIS SUMMARY SHOULD NOT BE USED AS PREDICTORS OF THE ACTUAL QUESTIONS APPEARING ON THE FINAL EXAM.
Implementing Mutual Exclusion Andy Wang Operating Systems COP 4610 / CGS 5765.
Lecture 4 CPU scheduling. Basic Concepts Single Process  one process at a time Maximum CPU utilization obtained with multiprogramming CPU idle :waiting.
Process Synchronization. Concurrency Definition: Two or more processes execute concurrently when they execute different activities on different devices.
EEE Embedded Systems Design Process in Operating Systems 서강대학교 전자공학과
Sarah Diesburg Operating Systems COP 4610
Process Synchronization
Processes and Threads Processes and their scheduling
April 6, 2001 Gary Kimura Lecture #6 April 6, 2001
Section 10: Last section! Final review.
Process management Information maintained by OS for process management
Inter-Process Communication and Synchronization
Lecture 11: Mutual Exclusion
MODERN OPERATING SYSTEMS Third Edition ANDREW S
Chapter 6: CPU Scheduling
Mid Term review CSC345.
COMS Prelim 1 Review Session
Chapter5: CPU Scheduling
Sarah Diesburg Operating Systems CS 3430
Chapter 5: CPU Scheduling
Exam Review Mark Stanovich Operating Systems COP
Lecture 2 Part 2 Process Synchronization
Concurrency: Mutual Exclusion and Process Synchronization
Chapter 5: CPU Scheduling
Operating Systems Lecture 1.
Major Topics in Operating Systems
Implementing Mutual Exclusion
February 5, 2004 Adrienne Noble
Lecture 11: Mutual Exclusion
Basic Synchronization
- When you approach operating system concepts there might be several confusing terms that may look similar but in fact refer to different concepts:  multiprogramming, multiprocessing, multitasking,
CSE 153 Design of Operating Systems Winter 19
Andy Wang Operating Systems COP 4610 / CGS 5765
Andy Wang Operating Systems COP 4610 / CGS 5765
Process Synchronization
CSE 153 Design of Operating Systems Winter 2019
Process Synchronization
Andy Wang Operating Systems COP 4610 / CGS 5765
Sarah Diesburg Operating Systems COP 4610
CPU Scheduling: Basic Concepts
Presentation transcript:

Sarah Diesburg Operating Systems CS 3430 Exam Review Sarah Diesburg Operating Systems CS 3430

Coverage Total: ~60 points; 1 min / point (12.5% of grade) Based on lectures 1-13, homeworks 1-3, project 1 Multiple choice, short answer, and problem solving questions

Introduction and History Definitions Operating system Job Batch system Timesharing

Introduction and History Definitions Multiprocessing Multithreading Multitasking Multiprogramming Uniprogramming

Introduction and History Short answers Four phases of OS history OS design goals

Concurrency: Threads, Address Spaces, and Processes Definitions Thread Address space Process Context switch

Concurrency: Threads, Address Spaces, and Processes Short answers Benefits of concurrency Thread vs. process Dispatching loop Thread state diagram

Genesis: From Raw Hardware to Processes Definitions Master boot record System call User mode Kernel mode Trap instruction

Genesis: From Raw Hardware to Processes Short answers Booting sequence System call sequence Process creation init process

CPU Scheduling Definitions Starvation

CPU Scheduling Short answers Preemptive vs. nonpreemptive scheduling FIFO RR SJN SRTF Multilevel feedback queues Lottery scheduling

Cooperating Threads Definitions Atomic operation Race condition

Cooperating Threads Short answers Independent threads Decision tree

Synchronization Definitions Mutual exclusion Critical section

Synchronization Short answers Code verification (e.g. how to test a locking solution)

Implementing Mutual Exclusion Definitions Busy waiting

Implementing Mutual Exclusion Short answers Ways to implement locks Interrupt disables test_and_set operation Atomic memory load and store Wait queues

Semaphores and Bounded Buffer Definitions Semaphore

Semaphores and Bounded Buffer Short answers Semaphores vs. integers Two uses of semaphores P() and V() functions

More on Semaphores Definitions Safety Liveness Fairness

More on Semaphores Short answers Code verification

Project 1 Be able to answer questions about the code Be able to write pseudocode to fork(), execute(), and waitpid() You don’t need to remember all the arguments to the system calls – just remember what system calls you used