RETRACTED: A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem

Jin Song Zhan; Yong Ning Guo; Cheng Lian Liu

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

Paper Titles

Top-Layer Design and Systematic Design of Products
p.1164

Security Analysis of Concast and Anycast Digital Signature
p.1177

Visual Psychology and View Methods in Modern Calligraphy Education
p.1183

An Intelligent Lane Markers Recognition and Localization System Using Improved Hough Transform
p.1186

RETRACTED: A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem
p.1191

The Research on Modeling of Design of Product
p.1196

An Explore about Low-Price Pressure Sensor
p.1200

Hydraulic Analysis and Optimization in Impeller of Magnetically Levitated Centrifugal Blood Pump
p.1204

Production Improvement of the Bacterial Cellulose by Taguchi Method
p.1209

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 121-126RETRACTED: A Deadlock Prevention Using Adjacency...

RETRACTED: A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem

Retracted:

This paper has been retracted by publisher.
This paper was found to be in violation of the scope and quality criteria. The document is now considered retracted. Due to strong violation, necessary effort should be made to remove all further references to this paper.
We regret any inconvenience this publication might cause you.

Abstract:

Retracted paper: 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.

By email View Pdf

You might also be interested in these eBooks

Frontiers of Manufacturing and Design Science II

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 121-126)

Pages:

1191-1195

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.121-126.1191

Online since:

October 2011

Authors:

Jin Song Zhan, Yong Ning Guo, Cheng Lian Liu

Keywords:

Dining Philosophers Problem, Memory Consistency, Prevent Deadlock, Resource Starvation

Export:

RIS, BibTeX

Permissions:

Creative Commons CC BY 4.0

Citation:

References

[1] E. W. Dijkstra: Hierarchical Ordering of Sequential Processes. Acta Informatica Vol. 1(1971), p.115–138.

DOI: 10.1007/bf00289519

Google Scholar

[2] K. M. CHANDY and J. MISRA: The Dining Philosopher's problem. ACM Transactions on Programming Languages and Systems Vol. 6(1984), p.632–646.

Google Scholar

[3] C. A. R. Hoare: Communicating Sequential Processes. Prentice Hall International, June 2004.

Google Scholar

[4] J. Zhan and Y. Guo: A Preliminary Study on the Dining Philosopher's problem. Fujian Computer Vol. 3(2008), p.78–79.

Google Scholar

[5] Wikipedia. Dining philosopher's problem. Website, 2011. http://en.wikipedia.org/wiki/Dining philosophers problem

Google Scholar

[6] A. Silberschatz, P. B. Galvin, and G. Gagne, Operating Systems Concepts. John Wiley and Sons Inc., Sixth edition, 1988.

Google Scholar

[7] P. Shrestha: Dining Philosopher Problem and Autoresetevent. Pradip's Blog, 2011. http://spradip.files.wordpress.com/2011/04/ic338850.png

Google Scholar