A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem

摘要：

　　In computer science,the dining philosophers 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.

关键词： Dining Philosophers Problem Prevent Deadlock Resource Starvation Memory Consistency

作者: Jinsong Zhan Yongning Guo Chenglian Liu

作者单位: Department of Mathematics and Computer Science,Fuqing Branch of Fujian Normal University, Fuqing 350300 China

会议类型: 国际会议

会议名称: the Second International Conference on Frontiers of Manufacturing and Design Science(第二届制造与设计科学国际会议(ICFMD 2011))

会议地点: 台湾

会议语种:英文

页码: 1191-1195

在线出版日期: 2011-12-11（万方平台首次上网日期，不代表论文的发表时间）