A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Dongye Sun, Wen-Pei Sung and Ran Chen

Pages:

1191-1195

DOI:

10.4028/www.scientific.net/AMM.121-126.1191

Citation:

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

Online since:

October 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.