Scribd Logo
Upload

Welcome to Scribd!

  • 26 views

    CS 31: Intro To Systems Processes: Kevin Webb Swarthmore College April 1, 2014

    Uploaded by

    Jared Williams
    This document provides an overview of processes in operating systems. It discusses key concepts like: - Processes are abstractions that represent running programs, and the OS keeps track of process states and scheduling. - Timesharing allows multiple processes to share a single CPU through rapid context switching between processes. When a process is blocked waiting for I/O, the CPU is allocated to another ready process. - Context switching involves saving the state of the current process and loading the saved state of the next process. This allows processes to voluntarily give up the CPU. - There is no single best CPU scheduling policy, as it depends on system goals, but common policies include round-robin and prioritizing

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    CS 31: Intro To Systems Processes: Kevin Webb Swarthmore College April 1, 2014

    Uploaded by

    Jared Williams
    26 views28 pages
    This document provides an overview of processes in operating systems. It discusses key concepts like: - Processes are abstractions that represent running programs, and the OS keeps track of process states and scheduling. - Timesharing allows multiple processes to share a single CPU through rapid context switching between processes. When a process is blocked waiting for I/O, the CPU is allocated to another ready process. - Context switching involves saving the state of the current process and loading the saved state of the next process. This allows processes to voluntarily give up the CPU. - There is no single best CPU scheduling policy, as it depends on system goals, but common policies include round-robin and prioritizing

    Original Description:

    13

    Original Title

    13 Processes

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides an overview of processes in operating systems. It discusses key concepts like: - Processes are abstractions that represent running programs, and the OS keeps track of process states and scheduling. - Timesharing allows multiple processes to share a single CPU through rapid context switching between processes. When a process is blocked waiting for I/O, the CPU is allocated to another ready process. - Context switching involves saving the state of the current process and loading the saved state of the next process. This allows processes to voluntarily give up the CPU. - There is no single best CPU scheduling policy, as it depends on system goals, but common policies include round-robin and prioritizing

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    26 views28 pages

    CS 31: Intro To Systems Processes: Kevin Webb Swarthmore College April 1, 2014

    Uploaded by

    Jared Williams
    This document provides an overview of processes in operating systems. It discusses key concepts like: - Processes are abstractions that represent running programs, and the OS keeps track of process states and scheduling. - Timesharing allows multiple processes to share a single CPU through rapid context switching between processes. When a process is blocked waiting for I/O, the CPU is allocated to another ready process. - Context switching involves saving the state of the current process and loading the saved state of the next process. This allows processes to voluntarily give up the CPU. - There is no single best CPU scheduling policy, as it depends on system goals, but common policies include round-robin and prioritizing

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 28

    CS 31: Intro to Systems

    Processes
    Kevin Webb
    Swarthmore College
    April 1, 2014

    Reading Quiz

    Anatomy of a Process
    Abstraction of a running program
    a dynamic program in execution

    OS keeps track of process state


    What each process is doing
    Which one gets to run next

    Basic operations
    Suspend/resume (context switch)
    Start (spawn), terminate (kill)

    Timesharing
    P1

    P2

    P3

    P1

    P2

    P3

    P1
    P2
    P3

    quantum

    time

    Multiple processes, single CPU (or small number)


    Conceptually, each process makes progress over time
    In reality, each periodically gets quantum of CPU time
    Illusion of parallel progress by rapidly switching CPU

    How is Timesharing Implemented?


    Kernel keeps track of progress of each process
    Characterizes state of processs progress
    Running: actually making progress, using CPU
    Ready: able to make progress, but not using CPU
    Blocked: not able to make progress, cant use CPU

    Kernel selects a ready process, lets it run


    Eventually, the kernel gets back control
    Selects another ready process to run,

    Why might a process be blocked


    (unable to make progress / use CPU)?
    A. Its waiting for another process to do something.
    B. Its waiting for memory to find and return a value.
    C. Its waiting for an I/O device to do something.
    D. More than one of the above. (Which ones?)
    E. Some other reason(s).

    Process State Diagram


    dispatch

    Ready

    Running
    preempt

    wake up

    sleep
    Blocked

    State transitions
    Dispatch: allocate the CPU to a process
    Preempt: take away CPU from process
    Sleep: process gives up CPU to wait for event
    Wakeup: event occurred, make process ready

    Kernel Maintains Process Table


    Process ID (PID)

    State

    Other info

    1534

    Ready

    Saved context,

    34

    Running

    Memory areas used,

    487

    Ready

    Saved context,

    Blocked

    Condition to unblock,

    List of processes and their states


    Also sometimes called process control block (PCB)

    Other state info includes


    contents of CPU context
    areas of memory being used
    other information

    Multiprogramming
    Given a running process
    At some point, it needs a resource, e.g., I/O device
    If resource is busy (or slow), process cant proceed
    Voluntarily gives up CPU to another process

    Mechanism: Context switching

    Context Switching
    Allocating CPU from one process to another
    First, save context of currently running process
    Next, load context of next process to run

    Context Switching
    Allocating CPU from one process to another
    First, save context of currently running process
    Next, load context of next process to run

    Loading the context


    Load general registers, stack pointer, etc.
    Load program counter (must be last instruction!)

    How a Context Switch Occurs


    Process makes system call (TRAP) or is interrupted
    These are the only ways of entering the kernel

    In hardware
    Switch from user to kernel mode: amplifies power
    Go to fixed kernel location: interrupt/trap handler

    In software (in the kernel)


    Save context of last-running process
    Conditionally
    Select new process from those that are ready
    Restore context of selected process

    OS returns control to a process from interrupt/trap

    Why shouldnt processes control


    context switching?
    A. It would cause too much overhead.
    B. They could refuse to give up the CPU.
    C. They dont have enough information about
    other processes.
    D. Some other reason(s).

    Multiprogramming
    Given a running process
    At some point, it needs a resource, e.g., I/O device
    If resource is busy (or slow), process cant proceed
    Voluntarily gives up CPU to another process

    Mechanism: Context switching


    Policy: CPU scheduling

    The CPU Scheduling Problem


    Given multiple processes, but only one CPU
    How much CPU time does each process get?
    Which process do we run next?
    Possibilities
    Keep CPU till done
    Each process uses CPU a bit and passes it on
    Each process gets proportional to what they pay

    Which CPU scheduling policy is the best?


    A. Processes keep CPU until done (maximize
    throughput)
    B. Processes use a fraction of CPU and pass it on
    (ensure fairness)
    C. Processes receive CPU in proportion to their
    priority or what they pay (prioritize importance)
    D. Other (explain)

    There is No Single Best Policy


    Depends on the goals of the system
    Different for
    Your personal computer
    Large time-shared (super) computer
    Computer controlling a nuclear power plant

    Often have multiple (conflicting) goals

    Common Policies
    Details beyond scope of this course (Take OS)
    Different classes of processes
    Those blessed by administrator (high/low priority)
    Everything else

    Common Policies
    Special class gets special treatment (varies)
    Everything else: roughly equal time quantum
    Round robin
    Give priority boost to processes that frequently
    perform I/O
    Why?

    I/O bound processes frequently block.


    If we want them to get equal CPU time, we need to
    give them the CPU more often.

    Linuxs Policy
    (Youre not responsible for this.)

    Special real time process classes (high prio)


    Other processes:
    Keep red-black BST of process, organized by how
    much CPU time theyve received.
    Pick the ready with process that has run for the
    shortest time thus far.
    Run it, update its CPU usage time, add to tree.

    Interactive processes: Usually blocked, low total


    run time, high priority.

    Managing Processes
    Processes created by calling fork()
    Spawning a new process

    Parent process spawns Child process


    Brutal relationship involving zombies, killing
    and reaping. (Im not making this up!)

    Processes interact with one another by


    sending signals.

    fork()
    System call (function provided by OS kernel)
    Creates a duplicate of the requesting process
    Process is cloning itself:
    CPU context
    Memory address space

    (Almost) identical clones

    OS
    Text
    Data
    Heap

    OS
    Text
    Data
    Heap

    OS
    Text
    Data
    Heap

    Stack

    Stack

    Stack

    fork() return value


    The two processes are identical in every way,
    except for the return value of fork().
    The child gets a return value of 0.
    The parent gets a return value of childs PID.
    pid_t pid = fork(); // both continue after call
    if (pid == 0) {
    printf("hello from child\n");
    } else {
    printf("hello from parent\n");
    }
    Which process executes next? Child? Parent? Some other process?

    Up to OS to decide. No guarantees. Dont rely on particular behavior!

    How many hellos will be printed?


    fork();
    printf(hello);
    if (fork()) {
    printf(hello);
    }
    fork();
    printf(hello);

    A.6
    B.8
    C.12
    D.16
    E.18

    Common fork() usage: Shell


    A shell is the program controlling your
    terminal (e.g., bash).
    It fork()s to create new processes, but we
    dont want a clone (another shell).

    We want the child to execute some other


    program: exec() family of functions.

    exec()
    Family of functions (execl, execlp, execv, ).
    Replace the current process with a new one.
    Loads program from disk:
    Old process is overwritten in memory.
    Does not return unless error.

    Common fork() usage: Shell


    1.fork()child process.
    2.exec()desired program to replace childs
    address space.
    3.wait()for child process to terminate.
    4. repeat

    To be continued

    You might also like