This document discusses inter-process communication and synchronization between processes. It defines that processes can communicate using shared memory or message passing. It also defines critical sections as code segments that access shared variables and must be executed atomically by only one process at a time to avoid race conditions. Race conditions occur when operations are attempted concurrently but must be done in a proper sequence. The solution presented is for processes to acquire a lock before entering the critical section to ensure only one process is in the critical section at a time.

1. NAME: DHWANI HINGORANI
ENR NO: 170410107025
SUBJECT: OPERATING SYSTEM

2. INTER PROCESS COMMUNICATION
 An independent process is not affected by the execution
of other processes while a co-operating process can be
affected by other executing processes. Though one can
think that those processes, which are running
independently, will execute very efficiently but in
practical, there are many situations when co-operative
nature can be utilised for increasing computational
speed, convenience and modularity. Inter process
communication (IPC) is a mechanism which allows
processes to communicate each other and synchronize
their actions. The communication between these
processes can be seen as a method of co-operation
between them.

3. PROCESSES CAN COMMUNICATE WITH EACH OTHER USING THESE
TWO WAYS:
Shared Memory Message Passing

4. CRITICAL SECTION
 A Critical Section is a code segment that accesses
shared variables and has to be executed as an
atomic action. It means that in a group of
cooperating processes, at a given point of time,
only one process must be executing its critical
section.

5. RACE CONDITION
A race condition is an
undesirable situation that
occurs when a device or
system attempts to
perform two or more
operations at the same
time, but because of the
nature of the device or
system, the operations
must be done in the
proper sequence to be
done correctly.

6. RACE CONDITION
Incorrect behaviour of a
program due to concurrent
execution of critical sections
by two or more threads.
For example, if thread one
deletes an entry in a linked
list while thread 2 is
accessing the same entry.

7. SOLUTION
 A simple solution to critical section can be thought as shown
below,
 acquireLock();
 Process Critical Section
 releaseLock();
 A thread must acquire a lock prior to executing critical section. The
lock can be acquired by only one thread. There are various ways to
implement locks in the above pseudo code.

8. THANK YOU