Synchronization of D. Parkinsonasynchronous concurrent processes using cellular automata

Abstract The use of a cellular processors network to synchronize a system of asynchronous concurrent processes in a trully parallel manner is demonstrated. The associated problems of deadlock and indefinite postponement are considered with particular reference to the classical synchronization problem known as the Dining Philosophers problem. A hardware model for the solution of the problem is presented. A more practical example such as the use of cellular processors for the synchronization of a multiprocessor system is also considered.