Presentation is loading. Please wait.

Presentation is loading. Please wait.

Sarah Diesburg Operating Systems CS 3430

Published byIwan Kusnadi Modified over 5 years ago

Similar presentations

Presentation on theme: "Sarah Diesburg Operating Systems CS 3430"— Presentation transcript:

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

2 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

3 Introduction and History
Definitions Operating system Job Batch system Timesharing

4 Introduction and History
Definitions Multiprocessing Multithreading Multitasking Multiprogramming Uniprogramming

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

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

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

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

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

10 CPU Scheduling Definitions Starvation

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

12 Cooperating Threads Definitions Atomic operation Race condition

13 Cooperating Threads Short answers Independent threads
Decision tree

14 Synchronization Definitions Mutual exclusion Critical section

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

16 Implementing Mutual Exclusion
Definitions Busy waiting

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

18 Semaphores and Bounded Buffer
Definitions Semaphore

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

20 More on Semaphores Definitions Safety Liveness Fairness

21 More on Semaphores Short answers Code verification

22 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

Download ppt "Sarah Diesburg Operating Systems CS 3430"

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.

1 Interprocess Communication 1. Ways of passing information 2. Guarded critical activities (e.g. updating shared data) 3. Proper sequencing in case of.
CAS3SH3 Midterm Review. The midterm 50 min, Friday, Feb 27 th Materials through CPU scheduling closed book, closed note Types of questions: True & False,

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

Chapter 6: Process Synchronization
Process Synchronization. Module 6: Process Synchronization Background The Critical-Section Problem Peterson’s Solution Synchronization Hardware Semaphores.

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.

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.

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.

Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
Review: Chapters 1 – 7. 1.2 Chapter 1: OS is a layer between user and hardware to make life easier for user and use hardware efficiently Control program.

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 311 - Operating.

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.

1 School of Computing Science Simon Fraser University CMPT 300: Operating Systems I Dr. Mohamed Hefeeda.
Avishai Wool lecture 2 - 1 Priority Scheduling Idea: Jobs are assigned priorities. Always, the job with the highest priority runs. Note: All scheduling.

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.

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

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.

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 2 2.1 Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.

1 Processes and Threads Chapter Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.
159.3351 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.

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.

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 Midterm Review.
CS 153 Design of Operating Systems Spring 2015 Lecture 11: Scheduling & Deadlock.

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.

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.

Similar presentations

Ads by Google