A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem
Jin Song Zhan, Yong Ning Guo, Chenglian Liu · Applied Mechanics and Materials · 2011
In computer science, the dining philosopher’s problem is an illustrative example of a common computing problem in concurrency. It is a classic multi-process synchronization problem. In this paper, we proposed a mathematical model which it expresses an adjacency matrix to show the deadlock occurs, and how resolve it.