Deadlock Detection Based on the Parallel Graph Theory Algorithm

Deadlock detection and release is an important means to maintain the concurrency of task in operating system, the relationship between system process and resources is usually described by means of resource allocation graph, the core of the deadlock detection is to determine whether there is a loop in the resource allocation graph and simplify the resource allocation graph. If using the traditional serial method to process the resource allocation graph, it will cause delay in the system even impossible to unlock in condition of a large number of processes exist in the system. This paper introduces the parallel processing of graph for deadlock detection, including two aspects: using the transitive closure algorithm on SIMD-CC model for loop detection in resource allocation graph, using the parallel P-BFS algorithm for Simplification of resource allocation graph. By parallel processing on the serial detection process, efficiency of the system in dealing with deadlock has been improved. Keywords-deadlock detection; parallel computing; resource allocation graph; loop detection; SIMD-CC

[1]  Michael J. Mossinghoff,et al.  Combinatorics and graph theory , 2000 .

[2]  MengChu Zhou,et al.  Resource-Transition Circuits and Siphons for Deadlock Control of Automated Manufacturing Systems , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[3]  MengChu Zhou,et al.  Supervisor Design to Enforce Production Ratio and Absence of Deadlock in Automated Manufacturing Systems , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[4]  Antonio Robles-Gómez,et al.  A Deadlock-Free Dynamic Reconfiguration Scheme for Source Routing Networks Using Close Up*/Down* Graphs , 2011, IEEE Transactions on Parallel and Distributed Systems.

[5]  Michael D. Ernst,et al.  Static lock capabilities for deadlock freedom , 2012, TLDI '12.

[6]  Geoffrey C. Fox,et al.  High Performance Parallel Computing with Clouds and Cloud Technologies , 2009, CloudComp.

[7]  James Demmel,et al.  the Parallel Computing Landscape , 2022 .

[8]  Martin Charles Golumbic,et al.  Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications , 2011 .

[9]  Rongming Zhu.  A deadlock prevention approach for flexible manufacturing systems with uncontrollable transitions in their Petri net models , 2012 .

[10]  M. Bóna.  A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory , 2006 .

[11]  William T. Tutte.  Graph theory as I have known it , 1998, Oxford lecture series in mathematics and its applications.

[12]  Rupak Biswas,et al.  High performance computing using MPI and OpenMP on multi-core parallel systems , 2011, Parallel Comput..

[13]  Państwowe Wydawnictwo Naukowe.,et al.  Combinatorics and graph theory , 1989 .

[14]  Jan-Philipp Weiss,et al.  Facing the Multicore-Challenge - Aspects of New Paradigms and Technologies in Parallel Computing [Proceedings of a conference held at Stuttgart, Germany, September 19-21, 2012] , 2013, Facing the Multicore-Challenge.