Module 2.1 COP4600 – Operating Systems Richard Newman

Slides:

Advertisements

Similar presentations

1 Processes and Threads Creation and Termination States Usage Implementations.

Advertisements

Processes and Threads Chapter 3 and 4 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College,

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

CS 149: Operating Systems February 3 Class Meeting

Pertemuan 13 Threads Matakuliah: H0483 / Network Programming Tahun: 2005 Versi: 1.0.

Operating Systems COMP 4850/CISG 5550 Processes Introduction to Threads Dr. James Money.

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

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.

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

1/27/2010CSCI 315 Operating Systems Design1 Processes Notice: The slides for this lecture have been largely based on those accompanying an earlier version.

1 What is a Process ? The activity of program execution. Also called a task or job Has associated with it: Code Data Resources A State An executing set.

CSCE 351: Operating System Kernels

Ceng Operating Systems Chapter 2.1 : Processes Process concept Process scheduling Interprocess communication Deadlocks Threads.

Chapter 2 Processes and Threads Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved

1 When to Switch Processes 3 triggers –System call, Interrupt and Trap System call –when a user program invokes a system call. e.g., a system call that.

OPERATING SYSTEM LESSON 4 PROCESS.

Operating Systems (CSCI2413) Lecture 3 Processes phones off (please)

Process Description and Control A process is sometimes called a task, it is a program in execution.

OPERATING SYSTEMS DESIGN AND IMPLEMENTATION Third Edition ANDREW S. TANENBAUM ALBERT S. WOODHULL Yan hao (Wilson) Wu University of the Western.

Process Description and Control Chapter 3. Major Requirements of an OS Interleave the execution of several processes to maximize processor utilization.

Processes and Threads.

Chapter 41 Processes Chapter 4. 2 Processes  Multiprogramming operating systems are built around the concept of process (also called task).  A process.

PROCESSES TANNENBAUM, SECTION 2-1 OPERATING SYSTEMS.

Chapter 3 Process Description and Control

MODERN OPERATING SYSTEMS Third Edition ANDREW S. TANENBAUM Chapter 2 Processes and Threads Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall,

The Functions of Operating Systems Interrupts. Learning Objectives Explain how interrupts are used to obtain processor time. Explain how processing of.

Hardware process When the computer is powered up, it begins to execute fetch-execute cycle for the program that is stored in memory at the boot strap entry.

1 Chapter 2.1 : Processes Process concept Process concept Process scheduling Process scheduling Interprocess communication Interprocess communication Threads.

ITEC 502 컴퓨터 시스템 및 실습 Chapter 2-1: Process Mi-Jung Choi DPNM Lab. Dept. of CSE, POSTECH.

Chapter 2 Processes and Threads Introduction 2.2 Processes A Process is the execution of a Program More specifically… – A process is a program.

Operating Systems Processes 1.

Process Models, Creation and Termination Reference –text: Tanenbaum ch. 2.1.

1 Computer Systems II Introduction to Processes. 2 First Two Major Computer System Evolution Steps Led to the idea of multiprogramming (multiple concurrent.

Process Description and Control Chapter 3. Source Modified slides from Missouri U. of Science and Tech.

Hardware process When the computer is powered up, it begins to execute fetch-execute cycle for the program that is stored in memory at the boot strap entry.

Process Description and control G.Anuradha (Referred from william stallings and galvin 8 th edition)

Cs431-cotter1 Processes and Threads Tanenbaum 2.1, 2.2 Crowley Chapters 3, 5 Stallings Chapter 3, 4 Silberschaz & Galvin 3, 4.

Processes and Threads MICROSOFT.  Process  Process Model  Process Creation  Process Termination  Process States  Implementation of Processes  Thread.

Process Control Management Prepared by: Dhason Operating Systems.

INTRO TO PROCESS SCHEDULING Module 2.4 COP4600 – Operating Systems Richard Newman.

Advanced Operating Systems CS6025 Spring 2016 Processes and Threads (Chapter 2)

Processes and Threads Chapter 3 and 4 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College,

Multiprogramming. Readings r Chapter 2.1 of the textbook.

Interrupts and signals

PROCESS MANAGEMENT IN MACH

OPERATING SYSTEMS CS3502 Fall 2017

Chapter 2 Processes and Threads Today 2.1 Processes 2.2 Threads

Process Description and Control

Process and Thread State Diagrams

Processes A process is a running program.

Scheduling in Interactive Systems

MODERN OPERATING SYSTEMS Third Edition ANDREW S

OS Basics Module 1.2 Richard Newman University of Florida.

Batch Scheduling Algorithms

Module 2.2 COP4600 – Operating Systems Richard Newman

Process Models, Creation and Termination

Introduction What is an operating system bootstrap

Processor Fundamentals

Process & its States Lecture 5.

OS Concepts Module 1.4 Richard Newman University of Florida.

Process Description and Control

Operating System Structure

Chapter 2 Processes and Threads 2.1 Processes 2.2 Threads

Process and Thread State Diagrams

Chapter 2 Processes and Threads 2.1 Processes 2.2 Threads

CS510 Operating System Foundations

Process Management -Compiled for CSIT

Process and Thread State Diagrams

Process Management -Compiled for CSIT

Process and Thread State Diagrams

Presentation transcript:

Module 2.1 COP4600 – Operating Systems Richard Newman Process Basics Module 2.1 COP4600 – Operating Systems Richard Newman

Process definition Algorithm = finite set of unambiguous instructions with finite initial storage and state, a specific starting instruction, and unambiguously determined next instruction and state at any point, except if the last instruction was halt. Often expressed with flow chart or pseudocode Program = sequence of instructions that embody an algorithm Source code → assembly code → machine code Process = program in execution = program + state May have many processes executing same program Process state = current instruction and state of memory, resources

pseudoparallelism Each process is given CPU in turn PC and other registers hold state of the process that is running System switches from one program to another by suspending current program, swapping state of registers, then starting new program Figure 2-1. (a) Multiprogramming of four programs. Tanenbaum & Bos,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved.

The Process Model - sequential Conceptually, each program has its own program counter Conceptually, each program runs independently of the others It is up to the system to see that the programs do not interfere with each other Figure 2-1. (b) Conceptual model of four independent, sequential processes. Tanenbaum & Bos,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved.

The Process Model – processor sharing B A Process using CPU Time Figure 2-1. (c) Only one program is active at once. Tanenbaum & Bos,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved.

Process Creation Four principal events that cause processes to be created: System initialization. Execution of a process creation system call by a running process. A user request to create a new process. Initiation of a batch job. Tanenbaum & Bos,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved.

Process Termination Typical conditions which terminate a process: Normal exit (voluntary). Error exit (voluntary). Fatal error (involuntary). Killed by another process (involuntary). Tanenbaum & Bos,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved.

Process States (1) States a process may be in: Running (actually using the CPU at that instant). Ready (runnable; temporarily stopped to let another process run). Blocked (unable to run until some external event happens). Initializing (system preparing process to run). Exiting (system cleaning up after process terminates). Swapped out & Blocked (image not in RAM, waiting for event) Swapped out & Ready (image not in RAM, not waiting for event) Tanenbaum & Bos, Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved.

Process States (2) Exiting Ready Running Blocked Initializing Swapped Select & dispatch Initialized Ready Running Halt Swap in Preempt Swapped Out-R Swap out Unblock Blocked Block Swap in Swapped Out-B Unblock Swap out

Process States (3) Figure 2-3. The lowest layer of a process-structured operating system handles interrupts and scheduling. Above that layer are sequential processes. Tanenbaum & Bos,Modern Operating Systems:4th ed., (c) 2013 Prentice-Hall, Inc. All rights reserved.

Summary What is a process Processor sharing Process Life Cycle Not the same as a program! Processor sharing Pseudoparallelism Process Life Cycle Process states and state transitions