Process synchronization
1.0 Problem Suppose there are n concurrent peer processes, where n > 1. All these processes have a checkpoint, which is an important point in the execution trace of the…
Dining philosophers problem
The dining philosophers problem is about deadlock in concurrent systems. The dining philosophers problem is explained with example programs.
POSIX Threads Synchronization in C
1.0 POSIX Threads Synchronization POSIX Threads provide multiple flows of execution within a process. The threads have their own stacks but share the global data and the heap. So the…
POSIX Semaphores in Linux
1.0 Semaphores Semaphores are used for process and thread synchronization. Semaphores are clubbed with message queues and shared memory under the Interprocess Communication (IPC) facilities in Unix-like systems such as…
System V Semaphores in Linux
1.0 Semaphores A semaphore is a mechanism for synchronizing processes and threads. Semaphore, in Unix-like systems, are provided under interprocess communication (IPC) facilities along with message queues and shared memory.…
Semaphore Basics
1.0 BACKGROUND A semaphore is a signalling mechanism used to regulate access to a shared resource like a railroad track. A semaphore is used to signal to the driver of…
rsync
rsync is a one-way file synchronization tool used in Linux and other Unix-like systems. It is used to ensure that the destination file(s) become an exact replica of corresponding file(s)…