Inter Process Communication

IPC refers to the mechanisms and techniques that operating systems use to facilitate
communication between different processes. In a multitasking environment, numerous
processes are running concurrently, and IPC serves as the bridge that allows them to
exchange information and coordinate their actions.

The Need for IPC

1. Data Sharing: Processes often need to share data. For example, a text
editor may need to pass data to a printer process to generate a hard copy.

2. Synchronization: Processes may need to synchronize their activities. For

instance, in a multi-threaded environment, threads must coordinate to
ensure data consistency.

3. Communication: Processes might need to communicate for a variety of

purposes, such as exchanging information, signaling, and error handling.

4. Resource Sharing: IPC helps manage and share resources, like file
access, memory, or hardware devices among processes.

IPC Methods
There are several methods of IPC used in modern operating systems. Each method has
its strengths and weaknesses, and the choice of method depends on the specific
requirements of the processes involved:

1. Message Passing: In message passing, processes exchange data by

sending and receiving messages through a messaging system. This method
is particularly useful for inter-process communication in distributed systems.

2. Shared Memory: Processes can communicate by sharing a common

memory region. This method is efficient but requires synchronization
mechanisms to avoid data inconsistencies.

3. Sockets: Sockets are commonly used for IPC in networked systems.

Processes can communicate over a network or on the same machine by
reading and writing data through sockets.

4. Pipes and FIFOs: These are used for communication between related
processes. Pipes are unidirectional, while FIFOs (named pipes) are
bidirectional and can be used between unrelated processes.

⁰
 5. Signals: Processes can send signals to each other to notify about events or
requests. Signals are lightweight and are often used for process
management and error handling.

Applications of IPC
IPC is a fundamental component of modern operating systems and finds applications in
various scenarios:

1. Shell Pipelines: In Unix-like systems, the shell uses pipes to connect the
output of one command to the input of another.

2. Graphical User Interfaces (GUIs): GUI applications use IPC for event
handling, such as sending messages between windows or processes.

3. Server-Client Communication: IPC is essential in client-server

applications. Clients and servers communicate over sockets, pipes, or other
IPC mechanisms.

4. Multi-threading: In multi-threaded programs, threads within a process must

communicate and synchronize through IPC mechanisms like semaphores
and mutexes.

5. Distributed Systems: IPC is crucial in distributed computing, where

processes may run on different machines. Message passing is commonly
used in such scenarios.

Disadvantages of IPC

While IPC is essential, it comes with its set of challenges, including:

1. Race Conditions: Processes must be carefully synchronized to avoid race

conditions that can lead to data corruption or inconsistencies.

2. Security: Unauthorized access to shared data can pose security risks.

Proper access control mechanisms are crucial.

3. Complexity: Implementing IPC can be complex, and errors can lead to

system instability.

4. Performance Overhead: Some IPC mechanisms, especially message

passing, can introduce performance overhead due to data copying and
context switching.

⁰
MULTIPROCCESSING AND PARALLEL PROCCESSING IN OPERATING SYSTEM

“Parallel computing is a type of computation in which many calculations or the

execution of processes are carried out simultaneously.

n simple terms, Parallel processing is an approach where a single program is divided

during execution in such a way that all the smaller parts can be processed independent
of other parts.

and

“Multiprocessing is the use of two or more central processing units (CPUs) within a
single computer system

Multiprocessing is the use of two or more processors synchronizing within the same
system. Synchronization means that these processing units works on the same task but
with independent resources & their results are added in the final solution.

Thus parallel_programming is an approach of simultaneously processing chunks of

same program & this is implemented using multiprocessing.

What is the Multiprocessing Operating System?

Multiprocessor operating systems are used in operating systems to boost the
performance of multiple CPUs within a single computer system.

Multiple CPUs are linked together so that a job can be divided and executed more
quickly. When a job is completed, the results from all CPUs are compiled to provide the
final output. Jobs were required to share main memory, and they may often share other
system resources. Multiple CPUs can be used to run multiple tasks at the same time,

Advantages of Multiprocessing OS
Increased reliability: Processing tasks can be spread among numerous processors in
the multiprocessing system. This promotes reliability because if one processor fails, the
task can be passed on to another.

Increased throughout: More work could be done in less time as the number of
processors increases.

The economy of scale: Multiprocessor systems are less expensive than single-
processor computers because they share peripherals, additional storage devices, and
power sources.

⁰
Disadvatages of Multiprocessing OS
Multiprocessing operating systems are more complex and advanced since they manage
many CPUs at the same time.

Types of Multiprocessing OS

Symmetrical
Each processor in a symmetrical multiprocessing system runs the same copy of the OS,
makes its own decisions, and collaborates with other processes to keep the system
running smoothly.

Characteristics

● Any processor in this system can run any process or job.

● Any CPU can start an Input and Output operation in this way.

Asymmetric
The processors in an asymmetric system have a master-slave relationship. In addition,
one processor may serve as a master or supervisor processor,

Resource allocation is a critical function of operating systems, where resources such as

CPU time, memory, and I/O devices are assigned to processes. Efficient resource
allocation is essential for optimal system performance. Operating systems use various
methods to allocate resources to processes, each with its advantages and
disadvantages. In this article, we will explore some common methods of resource
allocation used by operating systems.
What is resource allocation in operating systems?
Resource allocation in operating systems refers to the process of assigning system
resources, such as CPU time, memory, and I/O devices, to processes.
Methods of Resource Allocation to Processes by Operating Systems
Here are some Methods of Resource Allocation to Processes by Operating Systems:
1. Fixed Partitioning
Fixed partitioning is a simple memory management technique where memory is divided
into fixed-size partitions. Each partition can hold one process, and processes are
allocated to partitions based on their size. Fixed partitioning is easy to implement but
can lead to inefficient memory utilization, especially if processes are of varying sizes.
2. Variable Partitioning
Variable partitioning is a memory management technique where memory is divided into
variable-size partitions based on the size of the processes. When a process is loaded

⁰
into memory, it is allocated a partition that is large enough to accommodate it. Variable
partitioning allows for more efficient memory utilization compared to fixed partitioning
but requires more complex memory management algorithms.
3. First Fit Allocation
First fit allocation is a memory allocation algorithm where the operating system allocates
the first available partition that is large enough to accommodate a process. This method
is simple and efficient but can lead to fragmentation, where the available memory is
broken up into small, unusable chunks.
4. Best Fit Allocation
Best fit allocation is a memory allocation algorithm where the operating system allocates
the smallest available partition that is large enough to accommodate a process. This
method helps reduce fragmentation but can be less efficient than first fit allocation in
terms of memory utilization.
5. Worst Fit Allocation
Worst fit allocation is a memory allocation algorithm where the operating system
allocates the largest available partition to a process. This method can lead to more
fragmentation compared to first fit and best fit allocation but can be useful for allocating
large processes.
6. Round Robin Scheduling
Round robin scheduling is a CPU scheduling algorithm where each process is assigned
a fixed time slice or quantum to execute. Once a process’s time slice expires, it is
preempted, and the next process in the queue is executed. Round robin scheduling
ensures fairness among processes but can lead to inefficient CPU utilization if the time
slices are too small.
7. Priority-Based Scheduling
Priority-based scheduling is a CPU scheduling algorithm where each process is
assigned a priority. The operating system schedules processes with higher priorities
before processes with lower priorities. Priority-based scheduling ensures that important
processes are executed first but can lead to starvation, where low-priority processes
never get a chance to execute.