Scribd
Upload
39 views

Processes

The document discusses processes including their components, model, hierarchy, states, and operations. A process includes a program counter, stack, and data section. It progresses sequentially and includes active code and passive data sections. Multiple processes can execute the same program. Processes are created, scheduled between ready and running states, and terminated through system calls.

Uploaded by

sendhilks
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
39 views

Processes

The document discusses processes including their components, model, hierarchy, states, and operations. A process includes a program counter, stack, and data section. It progresses sequentially and includes active code and passive data sections. Multiple processes can execute the same program. Processes are created, scheduled between ready and running states, and terminated through system calls.

Uploaded by

sendhilks
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

Processes

K.S.SENDHIL KUMAR
Agenda
Process Concept
Process Model
Process Hierarchy
 Process – a program in execution; process execution must progress
in sequential fashion

 A process includes:
program counter
stack
data section

 Multiple parts
The program code, also called text section
Current activity including program counter, processor registers
Stack containing temporary data
Function parameters, return addresses, local variables
Data section containing global variables
Heap containing memory dynamically allocated during run time
 Program is passive entity, process is active
Program becomes process when executable file loaded
into memory
 Execution of program started via GUI mouse clicks,
command line entry of its name, etc
 One program can be several processes
Consider multiple users executing the same program
The process model
Single PC Multiple PCs  Multiprogramming of four
(CPU’s point of view) (process point of view) programs
 Conceptual model
A  4 independent processes
B A C D  Processes run sequentially
B  Only one program active at any
C
instant!
B  That instant can be very short…
D

D
C
B
A
Time
5
When is a process created?
Processes can be created in two ways
System initialization: one or more processes created
when the OS starts up
Execution of a process creation system call: something
explicitly asks for a new process
System calls can come from
User request to create a new process (system call
executed from user shell)
Already running processes
 User programs
 System daemons

6
When do processes end?
Conditions that terminate processes can be
Voluntary
Involuntary
Voluntary
Normal exit
Error exit
Involuntary
Fatal error (only sort of involuntary)
Killed by another process

CS 1550, cs.pitt.edu (originaly


7 Chapter 2 modified by Ethan L. Miller
and Scott A. Brandt)
Process hierarchies
Parent creates a child process
Child processes can create their own children
Forms a hierarchy
UNIX calls this a “process group”
If a process exits, its children are “inherited” by the
exiting process’s parent
Windows has no concept of process hierarchy
All processes are created equal

8 Chapter 2
Process State

As a process executes, it changes state


new: The process is being created
running: Instructions are being executed
waiting: The process is waiting for some event to
occur
ready: The process is waiting to be assigned to a
processor
terminated: The process has finished execution
Diagram of Process State
Process Control Block (PCB)

Information associated with each process


(also called task control block)
 Process state – running, waiting, etc
 Program counter – location of instruction
to next execute
 CPU registers – contents of all process-
centric registers
 CPU scheduling information- priorities,
scheduling queue pointers
 Memory-management information –
memory allocated to the process
 Accounting information – CPU used,
clock time elapsed since start, time limits
 I/O status information – I/O devices
allocated to process, list of open files
CPU Switch From Process to Process
Context Switch

 When CPU switches to another process, the system


must save the state of the old process and load the
saved state for the new process via a context switch
 Context of a process represented in the PCB
 Context-switch time is overhead; the system does no
useful work while switching
The more complex the OS and the PCB  the longer
the context switch
 Time dependent on hardware support
Some hardware provides multiple sets of registers per
CPU  multiple contexts loaded at once
Process Scheduling

 Maximize CPU use, quickly switch processes onto


CPU for time sharing
 Process scheduler selects among available processes
for next execution on CPU
 Maintains scheduling queues of processes
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
Representation of Process Scheduling

 Queueing diagram represents queues, resources,


flows
Schedulers
 Short-term scheduler (or CPU scheduler) – selects which process should be
executed next and allocates CPU
 Sometimes the only scheduler in a system
 Short-term scheduler is invoked frequently (milliseconds)  (must be fast)
 Long-term scheduler (or job scheduler) – selects which processes should be
brought into the ready queue
 Long-term scheduler is invoked infrequently (seconds, minutes)  (may be slow)
 The long-term scheduler controls the degree of multiprogramming
 Processes can be described as either:
 I/O-bound process – spends more time doing I/O than computations, many short
CPU bursts
 CPU-bound process – spends more time doing computations; few very long CPU
bursts
 Long-term scheduler strives for good process mix
Addition of Medium Term Scheduling

 Medium-term scheduler can be added if degree of


multiple programming needs to decrease
 Remove process from memory, store on disk,
bring back in from disk to continue execution:
swapping
Context Switch

 When CPU switches to another process, the system


must save the state of the old process and load the
saved state for the new process via a context switch
 Context of a process represented in the PCB
 Context-switch time is overhead; the system does no
useful work while switching
The more complex the OS and the PCB  the longer
the context switch
 Time dependent on hardware support
Some hardware provides multiple sets of registers per
CPU  multiple contexts loaded at once
Operations on Processes
 System must provide mechanisms for: process creation, process
termination, and so on.

Process Creation
 Parent process create children processes, which, in turn create
other processes, forming a tree of processes
 Generally, process identified and managed via a process identifier
(pid)
 Resource sharing options
Parent and children share all resources
Children share subset of parent’s resources
Parent and child share no resources
 Execution options
Parent and children execute concurrently
Parent waits until children terminate
A Tree of Processes in Linux
Process Creation (Cont.)

Address space
Child duplicate of parent
Child has a program loaded into it
UNIX examples
fork() system call creates new process
exec() system call used after a fork() to
replace the process’ memory space with a new
program
Process Termination

Process executes last statement and then asks the


operating system to delete it using the exit() system
call.
Returns status data from child to parent (via wait())
Process’ resources are deallocated by operating system
Parent may terminate the execution of children
processes using the abort() system call. Some
reasons for doing so:
Child has exceeded allocated resources
Task assigned to child is no longer required
The parent is exiting and the operating systems does not
allow a child to continue if its parent terminates
Process Termination

 Some operating systems do not allow child to exists if its parent


has terminated. If a process terminates, then all its children
must also be terminated.
cascading termination. All children, grandchildren, etc. are
terminated.
The termination is initiated by the operating system.
 The parent process may wait for termination of a child process
by using the wait()system call. The call returns status
information and the pid of the terminated process
pid = wait(&status);
 If no parent waiting (did not invoke wait()) process is a
zombie
 If parent terminated without invoking wait , process is an
orphan

You might also like