Paper Title:
A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem
  Abstract

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
Chapter
Chapter 2: Advanced Design Science (2)
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, Y. N. Guo, C. L. Liu, "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
$32.00
Share

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

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

Authors: Tian Zhong Sui, Zhen Tan, Lei Wang, Xiao Bin Gu, Zhao Hui Ren
Chapter 8: Algoritms
Abstract:Dimensioning work is a considerably important link in the whole Engineering Drawing. For existing completeness testing of dimensioning,...
351
Authors: Zheng Sheng Chen, Zhi Ping Lu, Chang Gui Li
Chapter 3: Information Technologies, WEB and Networks Engineering, Information Security, E-Engineering, Software Application and Development
Abstract:As the traditional implements of graph are complicated in data structure and hard to maintain, or short in storage utilization and low...
1456
Authors: Xiang Ping Li, Qing Shun Wang, Wei Sun
Chapter 1: Applied Mechanics and Dynamics, Mechanical Engineering, Manufacturing
Abstract:Rapid prototyping technology can generate parts directly from the three-dimensional CAD entity data, hierarchical algorithm is a key link in...
147