A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem
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.
Dongye Sun, Wen-Pei Sung and Ran Chen
J. S. Zhan et al., "A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem", Applied Mechanics and Materials, Vols. 121-126, pp. 1191-1195, 2012