View source for Interprocess Communication (IPC)

Official Definition: '''Interprocess communication (IPC)''' is used for programs to communicate data to each other and to synchronize their activities. Semaphores, shared memory, and internal message queues are common methods of interprocess communication.

What it means:<br />
IPC is a method for two or more separate programs or processes to communicate with each other. This avoids using real disk-based files and the associated I/O overhead to pass information. Like a file, you must first create or open the resource, use it and close it. Like real files, the resources have an owner, a group, and permissions. Until you remove the resource it continues to exist. Unlike real disk-based files, semaphores, message queues and shared memory do not persist across reboots.<ref>What is Interprocess Communication (IPC)? [https://www.ibm.com/support/pages/interprocess-communication-ipc-overview#1.3 IBM]</ref>


[[File:Interprocess Communication.png|400px|Interprocess Communication]]<br />
source: Tutorials Point


'''Synchronization in Interprocess Communication<ref>Synchronization in Interprocess Communication [https://www.tutorialspoint.com/what-is-interprocess-communication Tutorials Point]</ref>'''<br />
Synchronization is a necessary part of interprocess communication. It is either provided by the interprocess control mechanism or handled by the communicating processes. Some of the methods to provide synchronization are as follows −
*Semaphore: A semaphore is a variable that controls the access to a common resource by multiple processes. The two types of semaphores are binary semaphores and counting semaphores.
*Mutual Exclusion: Mutual exclusion requires that only one process thread can enter the critical section at a time. This is useful for synchronization and also prevents race conditions.
*Barrier: A barrier does not allow individual processes to proceed until all the processes reach it. Many parallel languages and collective routines impose barriers.
*Spinlock: This is a type of lock. The processes trying to acquire this lock wait in a loop while checking if the lock is available or not. This is known as busy waiting because the process is not doing any useful operation even though it is active.


== See Also ==







== References ==
<references />


== Popular Articles ==
<div style="column-count:4;-moz-column-count:4;-webkit-column-count:4">
*[[Personnel Management]]
*[[Architecture Development Method (ADM)]]
*[[IT Operating Model]]
*[[Strategic Intent]]
*[[Data Governance]]
*[[Business Capability]]
*[[IT Strategic Plan (Information Technology Strategic Plan)]]
*[[IT Ecosystem]]
*[[Information Technology (IT)]]
*[[International Accounting Standards Board (IASB)]]
*[[Economic Value Added (EVA)]]
*[[Strategic Business Unit]]
*[[Business Process Architecture]]
*[[Configuration Item (CI)]]
*[[IT Operations Management (ITOM)]]
*[[Organizational Goals]]
*[[Business Process Engineering (BPE)]]
</div>