The Problem According to Wikipedia the Dinning Philosophers Problem is described as follows: Five silent philosophers sit at a table around a bowl of spaghetti. A fork is placed between each pair of adjacent philosophers. (An alternative problem formulation uses rice and chopsticks instead of spaghetti and forks.) Each philosopher must alternately think and eat. However, a philosopher can only […]
According to Wikipeida the Producer Consumer Problem is defined as: In computing, the producer–consumer problem (also known as the bounded-buffer problem) is a classic example of a multi-process synchronization problem. The problem describes two processes, the producer and the consumer, who share a common, fixed-size buffer used as a queue. In essence, the producer consumer problem occurs in multithreaded processes when there is a […]
A semaphore is simple enough (from wikipedia): In computer science, particularly in operating systems, a semaphore is a variable or abstract data type that is used for controlling access, by multiple processes, to a common resource in a parallel programming or a multi user environment. More or less semaphores C++11 are used for is keeping track of how many resources are currently available for use at a […]