Operating Systems

Course Code: MCC510

Process Concept:
An Operating system executes a variety of programs via
➢ Batch system – Jobs
➢ Time shared systems - User programs or tasks

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510
Process:
➢ A program in execution is known as process and execution must be progress in
sequential fashion
➢ A process includes:
➢ program counter (The counter indicates the address of the next execution to
be executed for this purpose),
➢ Stack (Contains temporary data such as function, parameters, return
address and local variable)
➢ Data Section (includes global variable)

➢ Process in Memory:
➢ Heap-It is a memory dynamically allocated during process run time

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510
Process States:
As a process executes, it changes state as follows:
➢ New: The process is being executed
➢ 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

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Process Creation:
➢ Parent process creates children processes which in turn create other
processes and forming a tree of processes.

Possibilities

➢ Resource Sharing: Whenever a parent process creates a child processes these sub processes
can directly attain the required resources from the operating system also it
➢ Parents and children share all resources may be constructed to a subset of the resources of the parent process.
➢ Children share subset of parent’s resources The parent process may have to partition its resources among its
➢
subprocesses, or it can be capable to share some of the parent’s
Bounding the sub process to a sub set of
the parent’s resources avoid any process
parent and child share no resources. resources such as files and memory among the various its child
form overloading the system by creating ➢ Execution: processes. In this case sub processes are allocated the subset of
too many child processes. It helps to parent’s resources.
prevent creation of too many subprocesses
which can be a cause of confusion for
➢ Parents and children execute concurrently
operating system. ➢ Parent waits until children terminate.
➢ Address space:
➢ Child duplicates of parent
➢ Child has a program loaded into it
Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad
 Operating Systems
Course Code: MCC510
Process Creation:
➢ UNIX example:
➢ fork system call creates new process
➢ The new process is an exact copy of the parent and continues execution
from the same point as its parent.
➢ Exec system call used after a fork to replace the processes memory space
with a new program
➢ The only difference between parent and child is the value returned from the
fork call.
➢ 0 for the child.
➢ the process id (pid) of the child, for the parent.
➢ Using fork and exec we can write a simple command line interpreter.
while (true) {
read_command_line(&command,&parameters);
if(fork()!=0) {
waitpid(-1,&status,0);
} else {
execve(command,parameters,0);
}
}

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Process Creation:
A process may be created by another process using fork(). The creating
process is called the parent process and the created process is the child
process. A child process can have only one parent but a parent process may
have many children. Both the parent and child processes have the same
memory image, open files and environment strings. However, they have
distinct address spaces.

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510
Process Termination:
➢ Process termination occurs when the process is terminated. The exit()
system call is used by most operating systems for process termination.
Process executes last statement and asks the OS to terminate it via exit().
➢ Exit(or return) status value from child is received by parent via wait()
➢ Process resources are deallocated by OS

➢ Parents may terminate execution of children process via kill() function.

➢ Child has exceeded allocated resources
➢ Task assigned to child is no longer required
➢ If parent exit; some OS do not allow child to continue, if its parent
terminates.

➢ All children terminated that means cascading termination

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510
Reason for Process Termination :
➢ A process may be terminated after its execution is usually
completed. This process leaves the processor and
releases all its resources.
➢ A child process may be terminated if its parent process requests
for its termination.
➢ A process can be terminated if it tries to use a resource that it is
not allowed. e.g., A process can be terminated for trying to write
into a read only file.
➢ If an I/O failure occurs for a process, it can be terminated. e.g., If
a process requires the printer and it is not working, then the
process will be terminated.
➢ In most cases, if a parent process is terminated then its child
processes are also terminated. This is done because the child
process cannot exist without the parent process.
➢ If a process requires more memory than is currently available in
the system, then it is terminated because of memory scarcity.

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Process Control Block:

➢ Each process is represented in the OS by a PCB also known as Task Control
Block(TCB) which contains information associated with specific process
such as
➢ Process State
➢ Program counter
➢ CPU Registers
➢ CPU Scheduling Information
➢ Memory management information
➢ Accounting information
➢ I/O status information

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Process Scheduling:
➢ Process Scheduling is an OS jobs that schedules processes of different
states. It allows OS to allocate a time interval of CPU execution for each
process. Process scheduling system is used to keeps the CPU busy all the
time.
Process Scheduling Queues:
➢ Job queue - Set of all process in the system
➢ Ready queue - Set of all process in the main memory, ready and waiting to
execute
➢ Device queue - Set of all process waiting for an I/O device
➢ Processes migrate among the various queues.

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Representation of Process Scheduling:

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Schedulers:
Long Term Scheduler(Job Schedular):
➢ Select which processes should be brought into the ready queue
➢ The primary objective is to provide balanced mix of jobs such as I/O
bound and processor bound.
➢ It also control the degree of multiprogramming
Short Term Scheduler(CPU Schedular):
➢ Select which processes should be executed next and allocate to CPU
➢ The main objective is to increase system performance accordance with
chosen set of criteria
➢ It is the change of ready state to running state of the process.

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Comparison between Schedulers:

Long Term Scheduler:
➢ It is a Job Schedular
➢ Speed is less
➢ control the degree of multiprogramming
➢ Absent or minimal in time sharing system
➢ Select processes from a pool and load them into memory for execution
➢ Process state is new to ready
➢ Select a good process, mix of I/O bound and CPU bound.

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Comparison between Schedulers:

Short Term Scheduler :
➢ It is a CPU Schedular
➢ Speed is very fast
➢ Less control over the degree of multiprogramming
➢ Minimal in time sharing system
➢ Select among the processes that are ready to execute
➢ Process state is ready to running
➢ Select a new process for a CPU quite frequently

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Context Switch:
➢ When CPU switches to another process (Because of an interrupt), the
system must save the state of old process and load the saved state for new
process
➢ Context switch time is overhead and the system does no useful work while
switching
➢ Context switch time is highly dependent on hardware support
➢ When the process is switched, the information stored as
➢ Program counter
➢ Scheduling information
➢ Base and limit register
➢ Currently used register
➢ Changed state
➢ I/O state
➢ Accounting

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Inter Process Communication(IPC):

➢ It is a mechanism which allows processes to communicate with each other
and synchronize their actions. The communication between these
processes can be seen as a method of co-operation between them.
Message
queue
Direct FIFO
Comm.

Indirect IPC Pipe

Comm.

Message Shared
Passing Memory

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Inter Process Communication:

Independent Process:
➢ It is one that can not affect or be affected by the execution of another
process
Cooperating Process:
➢ It is one that can affect or be affected by the execution of another process
in the system.
➢ Advantages:
➢ Information sharing of the same piece of data
➢ Computation speed up via break a task into some smaller task
➢ Modularity dividing the system functions
➢ Convenience for doing the multiple task
➢ It requires an IPC mechanism which allow them to exchange data and
information

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Fundamental Models of Inter Process Communication:

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Fundamental Models of Inter Process Communication:

Message Passing:
➢ It is mechanism to allow processes to communicate and to synchronize
their actions
➢ No address space needs to be shared and particularly useful in a
distributed processing environment
➢ Message passing facility provides two operations
➢ Send(message)-size can be fixed or variable
➢ Receive(message)
➢ If P and Q want to communicate then they need to
➢ establish a communication link between them
➢ Exchange messages via send and receive

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Fundamental Models of Inter Process Communication:

Shared Memory:
➢ It requires communicating processes to establish a region of shared
memory
➢ Information is exchanged by reading and writing data in the shared
memory
➢ Producer consumer problem
➢ A producer process produces information that is consumed by a consumer
process
➢ Unbounded buffer-places no practical limit on the size of the buffer
➢ Bounded buffer-assumes that there is a fixed size of the buffer

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Direct Communication:
➢ Processes must name each other explicitly
➢ Send(P, message)-send a message to process P
➢ Receive(Q, message)- receive a message from process Q
➢ Properties of communication link:
➢ Links are established automatically between every pair of processes that want
to communicate
➢ A link is associated with exactly one pair of communicating processes
➢ Between each pair there exists exactly one link
➢ The link may be unidirectional but usually it is bidirectional

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Indirect Communication:
➢ Messages are directed and received from mailboxes (referred to Port)
➢ Each mailbox has unique id
➢ Processes can communicate only if they share a mailbox
➢ Send(P, message)-send a message to mailbox P
➢ Receive(P, message)- receive a message from mailbox P
➢ Properties of communication link:
➢ Links is established between a pair of processes only if both have shared
mailbox
➢ A link may be associated with more than two processes
➢ Between each pair of processes, there may be many different links, with each
link corresponding to one mailbox
➢ Mechanism provided by the operating system
➢ Create a new mailbox
➢ Send and receive messages through the mailbox
➢ Destroy the mailbox
Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad
 Operating Systems
Course Code: MCC510

Message Queues :
➢ A message queue is a linked list of messages stored within the kernel. It is
identified by a message queue identifier. This method offers
communication between single or multiple processes with full-duplex
capacity.
FIFO:
➢ Communication between two unrelated processes. It is a full-duplex
method, which means that the first process can communicate with the
second process, and the opposite can also happen.
Pipe:
➢ Pipe is widely used for communication between two related processes.
This is a half-duplex method, so the first process communicates with the
second process. However, in order to achieve a full-duplex, another pipe is
needed.

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510
Synchronization:
➢ Message passing may be either blocking or non- bocking
➢ Blocking is considered as synchronous
➢ Blocking send has the sender block until the messages is received
➢ Blocking receive has the receiver block until a message is available
➢ Non-Blocking is considered as asynchronous
➢ Non-blocking send has the sender send the messages and continue
➢ Non-blocking receive has the receiver receive a valid messages or null
Buffering:
➢ Whether communication is direct or indirect, messages exchanged by
communicating processes reside in a temporary queue
➢ These queue can be implemented in three ways
➢ Zero capacity-queue has a maximum length of zero that means sender must block
until the recipient receives the message
➢ Bounded capacity-queue has a finite length of n that means sender must wait if
queue is full
➢ Unbounded capacity-queue length is unlimited that means sender never blocks

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510
Communication in Client Server System:
Sockets:
➢ It is defined as an endpoint for communication and identified by an IP address
concatenated with a port number
➢ In general, sockets use client server architecture.[A client is a program or a process
which connects to another program (the server) and lets it carry out a specific
task. In particular it might require supplying some data from the server] [A server
is a program or a process which provides services for clients. For example, it might
supply some data or a result of processing data to clients] [A protocol is a language
of communication among programs; in particular between a client and a server]
➢ The server waits for incoming client requests by listening to a specified port. Once
a request is received, the server accepts a connection from the client socket to
complete the connection.
➢ Server implementing specific services such as telnet, ftp, http listen to well-known
ports i.e., 23,21 and 80 respectively.

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510
Port number with Protocol:
➢ Note that port is identified for each address and protocol by a 16-bit number known as port number. It is
associated with an IP address of the host as well as the type of protocol used for communication. Well-
known port (0-1023), registered port (1024-49151) and Dynamic or private port (49152-65535).
Port Number Protocol
7 ECHO[the echo server]
20 FTP[File Transfer Protocol ]-Data
21 FTP-commands
22 SSH Remote login Protocol
23 Telnet
25 SMTP[Simple mail transfer protocol]
37 Time
70 Gopher[Internet Gopher Protocol]-Hypertext link
80 HTTP[Hypertext Transfer Protocol]
110 POP3[Post Office Protocol]
119 NNTP[Network News Transfer Protocol]
123 NTP[Network Time Protocol]
143 IMAP[Internet Mail Access Protocol]
194 IRC[Internet Relay Chat]
443 HTTPS[TSL/SSL based HTTP]
989 FTPS[TSL/SSL based]-data
990 FTPS[TSL/SSL based]-command
992 Telnets [TSL/SSL based telnet]
993 IMAPS[TSL/SSL based IMAP4]
994 IRCS[TSL/SSL based IRC]
995 POP3S[TSL/SSL based POP3]
2628 DICT[the dictionary service ]
Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad
 Operating Systems
Course Code: MCC510

Communication in Client Server System:

Sockets:
➢ TCP (Transmission Control Protocol) is a connection-based protocol that
provides a reliable flow of data between two computers. It guarantees
that the sent data are not lost and arrive in the proper order to the
receiver.
➢ Identification of hosts in the network is made using IP (Internet Protocol)
addresses. An IP address is a 32-bit number (or a 128-bit for IPv6) typically
represented using the dot notation as a sequence of four (or eight)
numbers separated with dots (e.g. 192.33.71.12)

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Communication in Client Server System:

Sockets:
➢ UDP (User Datagram Protocol) is a protocol that sends independent
packets of data, called datagrams, from one computer to another with no
guarantees about arrival. UDP is not connection-based like TCP. Datagrams
may arrive to the receiver in an arbitrary order, some of them might be
lost.

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Communication in Client Server System:

Interaction between client and server through Sockets:
➢ The server binds a socket to a specific port number and starts waiting for
clients
➢ A client initializes a connection with the service specified by its host name
and port number
➢ The server accepts the connection made by the client and creates a new
socket for communicating with it
➢ From the client point of view, usually, the socket was used to initialize the
connection

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510
Communication in Client Server System:
Remote Procedure Call(RPC):
➢ The main idea of RPC is to allow a local computer(client) to remotely call
procedure on a remote computer(server)
➢ It is a message based communication scheme to provide remote service
➢ RPC abstracts the procedure call mechanism for use between the systems
with network connection
➢ The RPC hides the details that allow the communication to take place by
providing a stub on the client side.[Stub is a piece of code used for
converting parameters passed during RPC so that remote function call
looks like a local function call for the remote computer]
➢ Stub locates the port on the server and marshals the parameters.
Parameter marshalling involves packaging the parameters into a form that
can transmitted over a network.
➢ Stub then transmit a message to the server using message passing and the
stub on server side receives this message and invokes the procedure on
the server.
➢ RPC occurs when a process calls a procedure on a remote application.
Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad
 Operating Systems
Course Code: MCC510

Communication in Client Server System:

Remote Procedure Call(RPC):

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Communication in Client Server System:

Pipes:
➢ A pipe acts as a conduit allowing two processes to communicate
➢ Ordinary Pipe-It allow two processes to communicate in standard producer
consumer fashion in which producer write to one end of pipe (the write end) and
the consumer reads from the another end(the read end). As a result ordinary pipe
are unidirectional allowing only one way communication. If two way
communication is required then two pipes must be used with each pipe sending
data in different direction.

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad

 Operating Systems
Course Code: MCC510

Communication in Client Server System:

➢ Named Pipe-It is also known as FIFO for its behaviour and it is an extension to
the traditional pipe concept on UNIX. It can be used to transfer instruction
from one application to other without the use of intermediate temporary file.
It provide much more powerful communication tool that can be bidirectional
and no parent-child relationship is required.

Instructor: Prof M K Singh, Department of Mathematics and Computing, IIT(ISM) Dhanbad