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.

Slides:

Advertisements

Similar presentations

1 Processes and Threads Chapter Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.

Advertisements

OS, , Part II CPU Scheduling Department of Computer Engineering, PSUWannarat Suntiamorntut.

CAS3SH3 Midterm Review. The midterm 50 min, Friday, Feb 27 th Materials through CPU scheduling closed book, closed note Types of questions: True & False,

Operating Systems Operating Systems - Winter 2009 Chapter 2 - Processes Vrije Universiteit Amsterdam.

Cpr E 308 Spring 2004 Recap for Midterm Introductory Material What belongs in the OS, what doesn’t? Basic Understanding of Hardware, Memory Hierarchy.

Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 5: CPU Scheduling.

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.

Chapter 3: CPU Scheduling

Chapter 2: Processes Topics –Processes –Threads –Process Scheduling –Inter Process Communication (IPC) Reference: Operating Systems Design and Implementation.

CS 311 – Lecture 23 Outline Kernel – Process subsystem Process scheduling Scheduling algorithms User mode and kernel mode Lecture 231CS Operating.

Chapter 6: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 6: CPU Scheduling Basic.

CMPT 300: Operating Systems Review THIS REIVEW SHOULD NOT BE USED AS PREDICTORS OF THE ACTUAL QUESTIONS APPEARING ON THE FINAL EXAM.

Cs238 CPU Scheduling Dr. Alan R. Davis. CPU Scheduling The objective of multiprogramming is to have some process running at all times, to maximize CPU.

Figure 1.1 Interaction between applications and the operating system.

02/11/2004CSCI 315 Operating Systems Design1 CPU Scheduling Algorithms Notice: The slides for this lecture have been largely based on those accompanying.

Operating Systems Sameer Mahajan. Overview Process management Interrupts Memory management File system Device drivers Networking (TCP/IP, UDP) Security.

1 Processes and Threads Chapter Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.

Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.

Chapter 6: CPU Scheduling

Process Management. Processes Process Concept Process Scheduling Operations on Processes Interprocess Communication Examples of IPC Systems Communication.

Recall: Three I/O Methods Synchronous: Wait for I/O operation to complete. Asynchronous: Post I/O request and switch to other work. DMA (Direct Memory.

CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating Systems Examples Algorithm.

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.

30 October Agenda for Today Introduction and purpose of the course Introduction and purpose of the course Organization of a computer system Organization.

Mid Term review CSC345.

Chapter 2 Processes Processes Topics Process Concept Process Scheduling Operations on Processes Cooperating Processes Interprocess Communication.

Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria.

1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.

CIS250 OPERATING SYSTEMS Chapter 6 - CPU Scheduling Basic Concepts The objective of multi-programming is have a program running at all times Maximize.

OBJECTIVE: To learn about the various system calls. To perform the various CPU scheduling algorithms. To understand the concept of memory management schemes.

Review for Quiz-2 Applied Operating System Concepts Chap.s 1,2,6,7 - ECE3055b, Spring 2005.

Exam Review Andy Wang Operating Systems COP 4610 / CGS 5765.

Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.

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.

What is an Operating System? Various systems and their pros and cons –E.g. multi-tasking vs. Batch OS definitions –Resource allocator –Control program.

1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.

CPU Scheduling CSCI Introduction By switching the CPU among processes, the O.S. can make the system more productive –Some process is running at.

Unit - I Real Time Operating System. Content : Operating System Concepts Real-Time Tasks Real-Time Systems Types of Real-Time Tasks Real-Time Operating.

Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.

Basic Concepts Maximum CPU utilization obtained with multiprogramming

Computer-system operation (The OS initialization phase) ROM RAM

Sarah Diesburg Operating Systems COP 4610

Operating System (OS) QUESTIONS AND ANSWERS

Chapter 5a: CPU Scheduling

Chapter 6: CPU Scheduling

CPU Scheduling G.Anuradha

Chapter 6: CPU Scheduling

Module 5: CPU Scheduling

Operating System Concepts

Operating Systems.

Midterm review: closed book multiple choice chapters 1 to 9

COMS Prelim 1 Review Session

Chapter5: CPU Scheduling

Chapter 6: CPU Scheduling

Chapter 5: CPU Scheduling

Operating Systems Lecture 1.

Major Topics in Operating Systems

February 5, 2004 Adrienne Noble

Chapter 6: CPU Scheduling

Module 5: CPU Scheduling

Andy Wang Operating Systems COP 4610 / CGS 5765

Andy Wang Operating Systems COP 4610 / CGS 5765

Chapter 6: CPU Scheduling

CSE 153 Design of Operating Systems Winter 2019

Andy Wang Operating Systems COP 4610 / CGS 5765

Module 5: CPU Scheduling

Sarah Diesburg Operating Systems CS 3430

Presentation transcript:

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 driver? What is the history of OS's? What did people do in the 1950's without an OS? What is a batch System? What is Timesharing?

General What different types of OS are there? What is a Parallel System? What is a Distributed OS? What is a Real Time OS? What features does a modern OS have?

General What are some of the important concepts involved in OS design? What is a Process? What is Multiprogramming? What is Scheduling? What is a System Call? What is Inter-Process Communication?

General What is Concurrent Programming? What are threads? What is Communicating sequential processes (CSP)? Why do concurrent programming? How do we do it?

Hardware structures What is the overall structure of computer hardware? What are computers made of How are the CPU,Memory and I/O connected? What is Memory Management? What devices are connected to the I/O subsection? How is input and output performed? What is an interrupt? What types of interrupt are there? How are interrupts used for I/O?

Hardware structures What is DMA? What happens during a DMA transfer? What is the storage hierarchy? What is primary storage? What is secondary storage? What is buffering? What is caching?

Hardware structures How does the hardware support protection? What is Supervisor Mode? What is User Mode? What is allowed in Supervisor and User Modes? What is Memory Protection? How does the OS stay in control of the system?

Software Structures How is an OS written? What language/s should be used? What is the difference between a monolithic kernel and microkernel? What parts can the kernel be split up into? How do parts of the kernel communicate? How does the OS start?

Software Structures How does a User Communicate with the Operating System? What does a user need to do? What is a System Administrator? What does a System Administrator need to do. What is a Command-Interpreter? What are Systems Programs? What is a GUI?

Software Structures How does a program communicate with the Operating System? What is a System Call? How are parameters passed to the OS in a System Call? How can the OS be structured? What is the simplest structure? What is the Layered Approach? What is a Virtual Machine?

Processes What is the life cycle of a process? What is needed to store the complete state of a process? What states can a process be in? How does a process move from one state to another? How are Processes Created? What is the process tree? What does the unix fork system call do? What is a thread? What does the WIN32 CreateThread system call do? How does a process terminate?

Processes How are Processes Scheduled? What is the ready queue and wait queue? When do scheduling decisions need to be made? How do Processes Co-operate? Why do processes need to co-operate? What is shared Memory? What is the producer consumer problem? What is Busy Waiting?

Processes What is Inter-Process Communication(IPC)? Why do we need IPC? What types of IPC are there? How is IPC implemented? What is the difference between direct and indirect IPC? What is a mailbox? What is a pipe?

Scheduling What are the basic concepts of CPU scheduling? What is burst time? What is pre-emption? What is a context switch? What is the dispatcher? How do we compare scheduling algorithms? What are Utilisation, Throughput, Turnaround Time, Waiting Time and Response Time? What properties does a good scheduling algorithm have? What is a schedule diagram?

Scheduling What are some common scheduling algorithms? What is FCFS? What is SJF? What is SRTF? How do we predict the future for SJF and SRTF? What is RR? How do we choose the time quantum for RR? What is Priority Scheduling? What is a multilevel queue? What is a multilevel feedback queue?

Scheduling What other types of scheduling are there? What is multiprocessor scheduling? What is real time scheduling? How do we test a scheduling algorithm? What are the relative merits of Modelling, Simulation and Implementation?

Synchronisation Why is synchronisation important? What is a race condition? How can a race condition occur in the producer consumer problem? What is a critical section?

Synchronisation How can we solve the critical section problem? What properties must a solution have? How is a solution possible for two processes? How does the bakery algorithm solve the problem for more than 2 processes? What hardware is often used to help with critical sections? What is busy-waiting?

Synchronisation What is a semaphore? What does the value of a semaphore mean? What operations can be performed on semaphores? How are semaphores implemented? What Synchronisation examples do all the books use? What is the bounded buffer problem? What is the readers and writers problem? What is the dining philosophers problem? What is the sleeping barber problem?

Synchronisation How do high level languages support synchronisation? What is a monitor? How are monitors implemented? What is a condition variable? How does Java do synchronisation?