CGS 3763 Operating Systems Concepts Spring 2013

Slides:



Advertisements
Similar presentations
Processes Management.
Advertisements

CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
CMPT 300: Operating Systems I Dr. Mohamed Hefeeda
Thursday, June 08, 2006 The number of UNIX installations has grown to 10, with more expected. The UNIX Programmer's Manual, 2nd Edition, June, 1972.
1 Lecture 2: Review of Computer Organization Operating System Spring 2007.
1 School of Computing Science Simon Fraser University CMPT 300: Operating Systems I Dr. Mohamed Hefeeda.
1/27/2010CSCI 315 Operating Systems Design1 Processes Notice: The slides for this lecture have been largely based on those accompanying an earlier version.
Chapter 1 and 2 Computer System and Operating System Overview
1/23/2008CSCI 315 Operating Systems Design1 Processes Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating.
Process Management. Processes Process Concept Process Scheduling Operations on Processes Interprocess Communication Examples of IPC Systems Communication.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Processes.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 3: Processes Process Concept Process Scheduling Operations on Processes Cooperating.
Chapter 2 Processes and Threads Introduction 2.2 Processes A Process is the execution of a Program More specifically… – A process is a program.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Processes.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Process-Concept.
Lecture on Central Process Unit (CPU)
Chapter 2 Process Management. 2 Objectives After finish this chapter, you will understand: the concept of a process. the process life cycle. process states.
Chapter 3: Processes. 3.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 3: Processes Process Concept Process Scheduling Operations.
Interrupts and Exception Handling. Execution We are quite aware of the Fetch, Execute process of the control unit of the CPU –Fetch and instruction as.
Process Control Management Prepared by: Dhason Operating Systems.
CSCI/CMPE 4334 Operating Systems Review: Exam 1 1.
Advanced Operating Systems CS6025 Spring 2016 Processes and Threads (Chapter 2)
1 Computer System Overview Chapter 1. 2 Operating System Exploits the hardware resources of one or more processors Provides a set of services to system.
Operating System Components) These components reflect the services made available by the O.S. Process Management Memory Management I/O Device Management.
Introduction to Operating Systems Concepts
Processes and threads.
Chapter 3: Process Concept
Topic 3 (Textbook - Chapter 3) Processes
Operating Systems (CS 340 D)
Sujata Ray Dey Maheshtala College Computer Science Department
OPERATING SYSTEMS CS3502 Fall 2017
Process Management Presented By Aditya Gupta Assistant Professor
Chapter 3: Process Concept
Chapter 3: Processes.
Intro to Processes CSSE 332 Operating Systems
Operating Systems (CS 340 D)
CGS 3763 Operating Systems Concepts Spring 2013
Chapter 3: Processes.
CGS 3763 Operating Systems Concepts Spring 2013
Lecture 2: Processes Part 1
CGS 3763 Operating Systems Concepts Spring 2013
CGS 3763 Operating Systems Concepts Spring 2013
CGS 3763 Operating Systems Concepts Spring 2013
Process & its States Lecture 5.
Mid Term review CSC345.
CGS 3763 Operating Systems Concepts Spring 2013
Chapter 3: Processes.
Operating System Concepts
CGS 3763 Operating Systems Concepts Spring 2013
Lecture Topics: 11/1 General Operating System Concepts Processes
Process Description and Control
Sujata Ray Dey Maheshtala College Computer Science Department
Process Description and Control
Process Description and Control
Process Description and Control
Process Description and Control
Process Description and Control
Chapter 3: Processes.
Chapter 1 Computer System Overview
Operating Systems: A Modern Perspective, Chapter 6
Chapter 2 Processes and Threads 2.1 Processes 2.2 Threads
CS510 Operating System Foundations
Process Description and Control
Chapter 3: Processes Process Concept Process Scheduling
Chapter 3: Process Concept
Contact Information Office: 225 Neville Hall Office Hours: Monday and Wednesday 12:00-1:00 and by appointment. Phone:
CGS 3763 Operating Systems Concepts Spring 2013
COT 5611 Operating Systems Design Principles Spring 2014
Chapter 3: Process Management
Presentation transcript:

CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11:30 - 12:30 AM

Lecture 9 – Monday, January 28, 2013 Last time: Interrupts Problem 2.8 from Chapter 2 Today: Answers to student questions Interrupt processing Kernel data structures for process management Next time Creation and termination of processes Inter-process communication Shared memory Message passing Reading assignments Chapters 3 and 4 of the textbook Chapters 3 and 4 textbook slides HW1 due on Wednesday 11/20/2018

Student questions from week 2 Jan 14th Monday: A lot of people seem to have trouble understanding how things work physically. There are a lot of people asking, “Where are the registers,” or “Where is the cache,” etc. It would be really helpful if we could see more pictures with labels, or more diagrams in class of some of these things.   What is the purpose of abstraction? Is a thread part of a process or independent? How do threads work? Further explanation of hardware and software events. Further explanation of addresses as well. Cover in more detail what an abstraction is and Instruction Set Architecture. I also didn’t understand the difference between 32 and 64 bit operating systems. 11/20/2018

11/20/2018

11/20/2018

11/20/2018

Storage hierarchy 11/20/2018

Multi-level storage 11/20/2018

Caching Important principle, performed at many levels in a computer (in hardware, operating system, software) Information in use copied from slower to faster storage temporarily Faster storage (cache) checked first to determine if information is there If it is, information used directly from the cache (fast) If not, data copied to cache and used there Cache smaller than storage being cached Cache management important design problem Cache size and replacement policy 11/20/2018

11/20/2018

Student questions from week 2 (cont’d) Jan 16th Wednesday: What are MIPS and MFLOPS? Why are we interested in certain types of performance measurements over others for hardware (such as measuring CPU performance in MIPS or MFLOPS and no other measurements?   What is a type of interrupt? What is context switching and what is its main purpose? I would like more explanation of cache and it’s forms (ex. L1 cache) and how they are used in a system Jan 18th Friday: I would like an example of a problem that a computer cannot solve. Explain more about Universal computers. 11/20/2018

Examples of non-computable functions The truth function, which correctly labels the statements of arithmetic as true or false, is not computable. The halting problem function, which correctly labels program-input pairs as halting or non-halting, is easy to describe, but not computable. The Tiling function, which given any finite set of polygonal tiles, outputs the size k of the largest k×k sqaure that can be tiled by them, or 0 if they tile the entire plane. The Conjugate function, which given two words in a finite group presentation, correctly states whether they are conjugate or not. 11/20/2018

MIPS and MFLOPS The speed of a processor is measured in number of operations per second. There are two types of arithmetic operations and two distinct instruction execution units Integers  MIPS (Million Instructions Per Second) Floating point  MFLOPS (Million Floating Point Instructions Per Second) 11/20/2018

Interrupts  provide the means to react to internal and external events 11/20/2018

Context switching The storing and restoring the state (context) of a process so that execution can be resumed from the same point at a later time. Enables multiple processes/threads to share a single CPU.  11/20/2018

Process Control Block (PCB)

CPU Switch From Process to Process

Control data structure maintained by the kernel To carry out its functions the kernel must maintain information about all objects in the system. For example: Processes  Process Control Block (PCB) Open files  File Control Block (FCB) 11/20/2018

Process Control Block (PCB) The entry for a process contains the following information Process state Program counter CPU registers CPU scheduling information Memory-management information Accounting information I/O status information

Process Control Block (PCB)

The state of a process 11/20/2018

Interrupt handlers are a component of the kernel 11/20/2018

11/20/2018

11/20/2018

Kernel functions for program execution Process management Scheduling and resource allocation Interrupt handling Error handling 11/20/2018

System calls for process control Load Execute Create, terminate a process Block a process, abort Get process attributes/set process attributes Allocate/deallocate memory for a process 11/20/2018

Process Scheduling Queues Job queue – set of all processes in the system Ready queue – set of all processes residing in main memory, ready and waiting to execute Device queues – set of processes waiting for an I/O device Processes migrate among the various queues