What is a Process? Processes and Process Management Details for running a program

Similar documents
OS Structure, Processes & Process Management. Don Porter Portions courtesy Emmett Witchel

Fall 2017 :: CSE 306. Process Abstraction. Nima Honarmand

Processes. CS439: Principles of Computer Systems January 24, 2018

Getting to know you. Anatomy of a Process. Processes. Of Programs and Processes

Processes. CS439: Principles of Computer Systems January 30, 2019

CMPT 300. Introduction to Operating Systems. Operating Systems Processes & Threads

Introduction to OS Processes in Unix, Linux, and Windows MOS 2.1 Mahmoud El-Gayyar

Processes. CS3026 Operating Systems Lecture 05

Lecture 4: Process Management

Introduction to Processes

Processes and Non-Preemptive Scheduling. Otto J. Anshus

Processes. Sanzheng Qiao. December, Department of Computing and Software

W4118 Operating Systems. Junfeng Yang

Operating System Structure

PROCESS MANAGEMENT. Operating Systems 2015 Spring by Euiseong Seo

Mon Sep 17, 2007 Lecture 3: Process Management

CSE 153 Design of Operating Systems Fall 2018

Roadmap. Tevfik Ko!ar. CSC Operating Systems Fall Lecture - III Processes. Louisiana State University. Processes. September 1 st, 2009

PROCESSES. Jo, Heeseung

Processes. Jo, Heeseung

Reading Assignment 4. n Chapter 4 Threads, due 2/7. 1/31/13 CSE325 - Processes 1

COMPILING OBJECTS AND OTHER LANGUAGE IMPLEMENTATION ISSUES. Credit: Mostly Bryant & O Hallaron

Chap 4, 5: Process. Dongkun Shin, SKKU

Processes. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

OS lpr. www. nfsd gcc emacs ls 1/27/09. Process Management. CS 537 Lecture 3: Processes. Example OS in operation. Why Processes? Simplicity + Speed

Killing Zombies, Working, Sleeping, and Spawning Children

CS 31: Intro to Systems Processes. Kevin Webb Swarthmore College March 31, 2016

Processes and Threads. Processes and Threads. Processes (2) Processes (1)

2 Processes. 2 Processes. 2 Processes. 2.1 The Process Model. 2.1 The Process Model PROCESSES OPERATING SYSTEMS

CPSC 341 OS & Networks. Processes. Dr. Yingwu Zhu

CSE 410: Computer Systems Spring Processes. John Zahorjan Allen Center 534

PROCESS CONTROL BLOCK TWO-STATE MODEL (CONT D)

CS24: INTRODUCTION TO COMPUTING SYSTEMS. Spring 2018 Lecture 20

3. Process Management in xv6

Process Concepts. CSC400 - Operating Systems. 3. Process Concepts. J. Sumey

CSE 451: Operating Systems Winter Module 4 Processes. Mark Zbikowski Allen Center 476

! The Process Control Block (PCB) " is included in the context,

Ricardo Rocha. Department of Computer Science Faculty of Sciences University of Porto

Windows architecture. user. mode. Env. subsystems. Executive. Device drivers Kernel. kernel. mode HAL. Hardware. Process B. Process C.

Processes. Process Scheduling, Process Synchronization, and Deadlock will be discussed further in Chapters 5, 6, and 7, respectively.

Processes COMPSCI 386

www nfsd emacs lpr Process Management CS 537 Lecture 4: Processes Example OS in operation Why Processes? Simplicity + Speed

518 Lecture Notes Week 3

CSI Module 2: Processes

SE350: Operating Systems

CSE 380 Computer Operating Systems. Instructor: Insup Lee. University of Pennsylvania Fall 2003

CS 326: Operating Systems. Process Execution. Lecture 5

Computer Systems II. First Two Major Computer System Evolution Steps

Process management. What s in a process? What is a process? The OS s process namespace. A process s address space (idealized)

ECE 550D Fundamentals of Computer Systems and Engineering. Fall 2017

The Kernel Abstraction. Chapter 2 OSPP Part I

CSCE 313 Introduction to Computer Systems. Instructor: Dezhen Song

Processes & Threads. Today. Next Time. ! Process concept! Process model! Implementing processes! Multiprocessing once again. ! More of the same J

CSCE 313: Intro to Computer Systems

Prepared by Prof. Hui Jiang Process. Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University

OS lpr. www. nfsd gcc emacs ls 9/18/11. Process Management. CS 537 Lecture 4: Processes. The Process. Why Processes? Simplicity + Speed

Operating Systems CMPSCI 377 Spring Mark Corner University of Massachusetts Amherst

CSC 539: Operating Systems Structure and Design. Spring 2006

Processes. CS 416: Operating Systems Design, Spring 2011 Department of Computer Science Rutgers University

Process. Prepared by Prof. Hui Jiang Dept. of EECS, York Univ. 1. Process in Memory (I) PROCESS. Process. How OS manages CPU usage? No.

Operating System Design

CS 350 : COMPUTER SYSTEM CONCEPTS SAMPLE TEST 2 (OPERATING SYSTEMS PART) Student s Name: MAXIMUM MARK: 100 Time allowed: 70 minutes

Processes and Threads

Lecture 4: Memory Management & The Programming Interface

Jan 20, 2005 Lecture 2: Multiprogramming OS

csci3411: Operating Systems

CS 201. Processes. Gerson Robboy Portland State University

Problem Set: Processes

CSci 4061 Introduction to Operating Systems. Processes in C/Unix

Design Overview of the FreeBSD Kernel CIS 657

Processes. Dr. Yingwu Zhu

Problem Set: Processes

Design Overview of the FreeBSD Kernel. Organization of the Kernel. What Code is Machine Independent?

Today: Process Management. The Big Picture So Far. What's in a Process? Example Process State in Memory

Process a program in execution; process execution must progress in sequential fashion. Operating Systems

The Big Picture So Far. Today: Process Management

Chapter 3: Process Concept

Chapter 3: Process Concept

SMD149 - Operating Systems

Processes & Threads. (Chapter 3) CS 4410 Operating Systems. [R. Agarwal, L. Alvisi, A. Bracy, M. George, E. Sirer, R. Van Renesse]

Processes. Process Management Chapter 3. When does a process gets created? When does a process gets terminated?

Slide 6-1. Processes. Operating Systems: A Modern Perspective, Chapter 6. Copyright 2004 Pearson Education, Inc.

The Kernel. wants to be your friend

Processes. Johan Montelius KTH

Chapter 3: Process Concept

Processes. CS 475, Spring 2018 Concurrent & Distributed Systems

CS 3733 Operating Systems

Agenda Process Concept Process Scheduling Operations on Processes Interprocess Communication 3.2

Processes. CSE 2431: Introduction to Operating Systems Reading: Chap. 3, [OSC]

A process. the stack

Processes. OS Structure. OS Structure. Modes of Execution. Typical Functions of an OS Kernel. Non-Kernel OS. COMP755 Advanced Operating Systems

Operating Systems. II. Processes

Last time: introduction. Networks and Operating Systems ( ) Chapter 2: Processes. This time. General OS structure. The kernel is a program!

Chapter 3: Processes. Operating System Concepts 8th Edition,

by Marina Cholakyan, Hyduke Noshadi, Sepehr Sahba and Young Cha

Why use an Operating System? Operating System Definition

REVIEW OF COMMONLY USED DATA STRUCTURES IN OS

The Process Abstraction. CMPU 334 Operating Systems Jason Waterman

Process. Program Vs. process. During execution, the process may be in one of the following states

Linux Operating System

Transcription:

1 What is a Process? Program to Process OS Structure, Processes & Process Management Don Porter Portions courtesy Emmett Witchel! A process is a program during execution. Ø Program = static file (image) Ø Process = executing program = program + execution.! A process is the basic unit of execution in an operating system Ø Each process has a number, its process identifier (pid).! Different processes may run different instances of the same program Ø E.g., my javac and your javac process both run the Java compiler! At a minimum, process execution requires following resources: Ø Memory to contain the program code and data Ø A set of CPU registers to support execution! We write a program in e.g., Java.! A compiler turns that program into an instruction list.! The CPU interprets the instruction list (which is more a graph of basic blocks). 2 3 Process in Memory Processes and Process Management Details for running a program Keeping track of a process! Program to process.! What you wrote! What must the OS track for a process?! What is in memory. main; a = 2 X; b = 2 Heap Code! A program consists of code and data! On running a program, the loader: Ø reads and interprets the executable file Ø sets up the process s memory to contain the code & data from executable Ø pushes argc, argv on the stack Ø sets the CPU registers properly & calls _start()! Program starts running at _start() _start(args) { initialize_java(); ret = main(args); exit(ret) we say process is now running, and no longer think of program! When main() returns, OS calls exit() which destroys the process and returns all resources! A process has code. Ø OS must track program counter (code location).! A process has a stack. Ø OS must track stack pointer.! OS stores of processes computation in a process control block (PCB). Ø E.g., each process has an identifier (process identifier, or PID)! Data (program instructions, stack & heap) resides in memory, metadata is in PCB (which is a kernel data structure in memory) 4 5 6

7 Context Switching! The OS periodically switches execution from one process to another! Called a context switch, because the OS saves one execution context and loads another What causes context switches?! Waiting for I/O (disk, network, etc.) Ø Might as well use the CPU for something useful Ø Called a blocked! Timer interrupt (preemptive multitasking) Ø Even if a process is busy, we need to be fair to other programs! Voluntary yielding (cooperative multitasking)! A few others Ø Synchronization, IPC, etc. Process Life Cycle! Processes are always either executing, waiting to execute or blocked waiting for an event to occur Start Ready Blocked Done Running! A preemptive scheduler will force a transition from running to ready. A non-preemptive scheduler waits. 8 9 Process Contexts Example: Multiprogramming Scheduling Processes User Program n... User Program 2 User Program 1 System Software Operating System Memory Program 1 OS Program 2 k: read() k+1: main{ save read{ startio() schedule() endio{ schedule() restore main{ save I/O Device interrupt When a process is waiting for I/O what is its scheduling? 1. Ready 2. Running 3. Blocked 4. Zombie 5. Exited! OS has PCBs for active processes.! OS puts PCB on an appropriate queue. Ø Ready to run queue. Ø Blocked for IO queue (Queue per device). Ø Zombie queue.! Stopping a process and starting another is called a context switch. Ø 100-10,000 per second, so must be fast. 10 11 12

13 Why Use Processes? Why Use Processes? Where do new processes come from? Consider a Web server get network message (URL) from client fetch URL data from disk compose response send response How well does this web server perform? With many incoming requests? That access data all over the disk? Consider a Web server get network message (URL) from client create child process, send it URL Child fetch URL data from disk compose response send response! If server has configuration file open for writing Ø Prevent child from overwriting configuration! How does server know child serviced request? Ø Need return code from child process! Parent/child model! An existing program has to spawn a new one Ø Most OSes have a special init program that launches system services, logon daemons, etc. Ø When you log in (via a terminal or ssh), the login program spawns your shell 14 15 Approach 1: Windows CreateProcess Approach 2: Unix fork/exec() The Convenience of separating Fork/Exec! In Windows, when you create a new process, you specify a new program Ø And can optionally allow the child to inherit some resources (e.g., an open file handle)! In Unix, a parent makes a copy of itself using fork() Ø Child inherits everything, runs same program Ø Only difference is the return value from fork()! A separate exec() system call loads a new program! Major design trade-off: Ø How easy to inherit Ø Vs. Security (accidentally inheriting something the parent didn t intend) Ø Note that security is a newer concern, and Windows is a newer design! Life with CreateProcess(filename); Ø But I want to close a file in the child. CreateProcess(filename, list of files); Ø And I want to change the child s environment. CreateProcess(filename, CLOSE_FD, new_envp); Ø Etc. (and a very ugly etc.)! fork() = split this process into 2 (new PID) Ø Returns 0 in child Ø Returns pid of child in parent! exec() = overlay this process with new program (PID does not change) 16 17 18

19 The Convenience of Separating Fork/Exec! Decoupling fork and exec lets you do anything to the child s process environment without adding it to the CreateProcess API. // create a child If(0 == pid) { // child continues here // Do anything (unmap memory, close net connections) exec( program, argc, argv0, argv1, );! fork() creates a child process that inherits: Ø identical copy of all parent s variables & memory Ø identical copy of all parent s CPU registers (except one)! Parent and child execute at the same point after fork() returns: Ø by convention, for the child, fork() returns 0 Ø by convention, for the parent, fork() returns the process identifier of the child Ø fork() return code a convenience, could always use getpid() Program Loading: exec()! The exec() call allows a process to load a different program and start execution at main (actually _start).! It allows a process to specify the number of arguments (argc) and the string argument array (argv).! If the call is successful Ø it is the same process Ø but it runs a different program!!! Code, stack & heap is overwritten Ø Sometimes memory mapped files are preserved. General Purpose Process Creation In the parent process: main() int pid =fork(); // create a child if(0 == pid) { // child continues here exec_status = exec( calc, argc, argv0, argv1, ); printf( Why would I execute? ); else { // parent continues here printf( Who s your daddy? ); child_status = wait(pid); 20 21 A shell forks and then execs a calculator A shell forks and then execs a calculator At what cost, fork()? USER OS if(pid == 0) { close(.history ); exec( /bin/calc ); else { wait(pid); pid = 128 127 open files =.history pid = 128 open files = int pid calc_main(){ = fork(); if(pid int q == = 0) 7; { close(.history ); do_init(); exec( /bin/calc ); ln = get_input(); else exec_in(ln); { wait(pid); Blocks (PCBs) 22 main; a = 2 0xFC0933CA Heap int shell_main() { Code USER OS pid = 127 128 open files =.history pid = 128 open files = 0x43178050 Heap int calc_main() { int q = 7; Code Blocks (PCBs) 23! Simple implementation of fork(): Ø allocate memory for the child process Ø copy parent s memory and CPU registers to child s Ø Expensive!!! In 99% of the time, we call exec() after calling fork() Ø the memory copying during fork() operation is useless Ø the child process will likely close the open files & connections Ø overhead is therefore high! vfork() Ø a system call that creates a process without creating an identical memory image Ø child process should call exec() almost immediately Ø Unfortunate example of implementation influence on interface Current Linux & BSD 4.4 have it for backwards compatibility Ø Copy-on-write to implement fork avoids need for vfork 24

25 Orderly Termination: exit() The wait() System Call! After the program finishes execution, it calls exit()! This system call: Ø takes the result of the program as an argument Ø closes all open files, connections, etc. Ø deallocates memory Ø deallocates most of the OS structures supporting the process Ø checks if parent is alive: v If so, it holds the result value until parent requests it; in this case, process does not really die, but it enters the zombie/defunct v If not, it deallocates all data structures, the process is dead Ø cleans up all waiting zombies! Process termination is the ultimate garbage collection (resource reclamation).! A child program returns a value to the parent, so the parent must arrange to receive that value! The wait() system call serves this purpose Ø it puts the parent to sleep waiting for a child s result Ø when a child calls exit(), the OS unblocks the parent and returns the value passed by exit() as a result of the wait call (along with the pid of the child) Ø if there are no children alive, wait() returns immediately Ø also, if there are zombies waiting for their parents, wait() returns one of the values immediately (and deallocates the zombie) OS must include calls to enable special control of a process:! Priority manipulation: Ø nice(), which specifies base process priority (initial priority) Ø In UNIX, process priority decays as the process consumes CPU! Debugging support: Ø ptrace(), allows a process to be put under control of another process Ø The other process can set breakpoints, examine registers, etc.! Alarms and time: Ø Sleep puts a process on a timer queue waiting for some number of seconds, supporting an alarm functionality 26 27 Tying it All Together: The Unix Shell Summary while(! EOF) { read input handle regular expressions // create a child if(pid == 0) { // child continues here exec( program, argc, argv0, argv1, ); else { // parent continues here! Understand what a process is! The high-level idea of context switching and process s! How a process is created! Pros and cons of different creation APIs Ø Intuition of copy-on-write fork and vfork! Translates <CTRL-C> to the kill() system call with SIGKILL! Translates <CTRL-Z> to the kill() system call with SIGSTOP! Allows input-output redirections, pipes, and a lot of other stuff that we will see later 28 29