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 – V –Implementing Semaphore without busy waiting

In the previous post, we discussed about mutex locks and semaphores and the differences between them. We also discussed how mutex implementations and the sempahore implementations (using wait() and signal() ) discussed previously suffered from busy waiting, which entails doing a lot of unnecessary work. Let us now discuss implementing Read More …