Process Synchronization – IX – Dining Philosophers Problem

In the previous post, we discussed the Reader-Writers Problem, which is one of the classical problems of synchronization.  In this post, we shall discuss the Dining Philosophers problem (first proposed by EW Dijkstra), which is a simple representation of a large class of concurrency-control problems. In these types of problems, Read More …

Process Synchronization – VIII – Readers-Writers Problem

In the previous post, we discussed the Bounded buffer problem. Let us now discuss the Readers-Writers problem, which is another interesting process synchronization problem. These classical synchronization problems are used to test nearly every new synchronization primitive. Problem Statement Let us imagine a system where several processes are executing concurrently. Read More …

Process Synchronization – VII – Bounded Buffer Problem

In the previous posts, we have discussed several aspects of process synchronization, which includes discussing a solution of the bounded buffer problem. In this post, we shall discuss a solution to the bounded-buffer problem using semaphores. THE BOUNDED-BUFFER PROBLEM In our first post on process synchronization, we had discussed the Read More …