Scribd
Upload
34 views23 pages

Unit-1 3

The document introduces processes as programs in execution. It describes processes having code, data, stack and heap sections. Processes can be in various states like new, running, ready, waiting, terminated. A process control block (PCB) stores process information. Processes are scheduled by the operating system using scheduling queues. Processes can create child processes and communicate via shared memory or message passing. Context switches occur when the CPU switches between processes.

Uploaded by

ragul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
34 views23 pages

Unit-1 3

The document introduces processes as programs in execution. It describes processes having code, data, stack and heap sections. Processes can be in various states like new, running, ready, waiting, terminated. A process control block (PCB) stores process information. Processes are scheduled by the operating system using scheduling queues. Processes can create child processes and communicate via shared memory or message passing. Context switches occur when the CPU switches between processes.

Uploaded by

ragul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

U18IT T4001 Operati ng

Systems
W E E K 1 DAY 3
Proc e ss
Objectives
To introduce the notion of a process -- a program in execution, which
forms the basis of all computation

To describe the various features of processes, including scheduling,


creation and termination, and communication

To explore interprocess communication using shared memory and


message passing

To describe communication in client-server systems


Process Concept
An operating system executes a variety of programs:
Batch system – jobs
Time-shared systems – user programs or tasks

Process – a program in execution; process execution must progress in


sequential fashion

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
Process Concept (Cont.)
Program is passive entity stored on disk (executable file), process
is active

Program becomes process when executable file loaded into


memory

One program can be several processes


Eg:
Consider multiple users executing the same program
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
Threads
So far, process has a single thread of execution

Consider having multiple program counters per process


Multiple locations can execute at once
Multiple threads of control -> threads

Must then have storage for thread details, multiple program


counters in PCB
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
Ready Queue And Various I/O Device
Queues
Representation of Process Scheduling
 Queueing diagram represents queues, resources, flows
Scheduling Queues
A new process is initially put in the ready queue. It waits there until it is selected for execution, or
dispatched. Once the process is allocated the CPU and is executing, one of several events could occur:

• The process could issue an I/O request and then be placed in an I/O queue.
• The process could create a new child process and wait for the child’s termination.
• The process could be removed forcibly from the CPU, as a result of an interrupt, and be put back in
the ready queue.

In the first two cases, the process eventually switches from the waiting state to the ready state and is
then put back in the ready queue. A process continues this cycle until it terminates, at which time it is
removed from all queues and has its PCB and resources deallocated.
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
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
R e fe r e n c e
• Operating System Concepts, Silberschatz and Galvin
• Operating System Concepts - slides (os-book.com)
• https://www.os-book.com/OS9/slide-dir/index.html

You might also like