A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem

被引:0
|
作者
Zhan, Jinsong [1 ]
Guo, Yongning [1 ]
Liu, Chenglian [1 ]
机构
[1] Fujian Normal Univ, Dept Math & Comp Sci, Fuqing Branch, Fuqing 350300, Peoples R China
关键词
Dining Philosophers Problem; Prevent Deadlock; Resource Starvation; Memory Consistency;
D O I
10.4028/www.scientific.net/AMM.121-126.1191
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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.
引用
收藏
页码:1191 / 1195
页数:5
相关论文
共 50 条
  • [11] An approach to solve graph coloring problem using adjacency matrix
    Shukla, Ajay Narayan
    Garg, M. L.
    BIOSCIENCE BIOTECHNOLOGY RESEARCH COMMUNICATIONS, 2019, 12 (02): : 472 - 477
  • [12] An Approach for Solving the Graph Coloring Problem using Adjacency Matrix
    Negi, Charu
    Shukla, Ajay Narayan
    PROCEEDINGS OF THE 2019 8TH INTERNATIONAL CONFERENCE ON SYSTEM MODELING & ADVANCEMENT IN RESEARCH TRENDS (SMART-2019), 2019, : 10 - 13
  • [13] Placating Plato with Plates of Pasta: An Interactive Tool for Teaching the Dining Philosophers Problem
    DeBenedetto, Justin
    Hutt, Stephen
    Faust, Louis
    Liu, Anqing
    Kremer-Herman, Nathaniel
    2017 IEEE FRONTIERS IN EDUCATION CONFERENCE (FIE), 2017,
  • [14] Verifying Solutions to the Dining Philosophers Problem with Activity-Oriented Petri Nets
    Davidrajuh, Reggie
    PROCEEDINGS 2014 4TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE WITH APPLICATIONS IN ENGINEERING AND TECHNOLOGY ICAIET 2014, 2014, : 163 - 168
  • [15] Vertex colouring using the adjacency matrix
    Santoso, K. A.
    Dafik
    Agustin, I. H.
    Prihandini, R. M.
    Alfarisi, R.
    2ND INTERNATIONAL CONFERENCE OF COMBINATORICS, GRAPH THEORY, AND NETWORK TOPOLOGY, 2019,
  • [16] Generalising the Dining Philosophers Problem: Competitive Dynamic Resource Allocation in Multi-agent Systems
    De Masellis, Riccardo
    Goranko, Valentin
    Gruner, Stefan
    Timm, Nils
    MULTI-AGENT SYSTEMS, EUMAS 2018, 2019, 11450 : 30 - 47
  • [17] Digital Filters Using Adjacency Matrix Representation
    Sa, Leonardo
    Mesquita, Antonio
    MICAI 2008: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5317 : 394 - 406
  • [18] Implementation of Vertex Colouring Using Adjacency Matrix
    Indumathi, S. M.
    Prajwala, N. B.
    Pushpa, N. B.
    2021 5TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS, COMMUNICATION, COMPUTER TECHNOLOGIES AND OPTIMIZATION TECHNIQUES (ICEECCOT), 2021, : 69 - 73
  • [19] Deadlock prevention using Petri nets and their unfoldings
    Taubin, A
    Kondratyev, A
    Kishinevsky, M
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 1998, 14 (10): : 750 - 759
  • [20] Deadlock prevention using Petri nets and their unfoldings
    Univ of Aizu, Aizu-Wakamatsu, Japan
    Int J Adv Manuf Technol, 10 (750-759):