Operation systems: advanced concepts
Operation systems: advanced concepts
Pthreads programming
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
A novel parallel deadlock detection algorithm and architecture
Proceedings of the ninth international symposium on Hardware/software codesign
An Algorithmic Approach on Deadlock Detection for Enhanced Parallelism in Multiprocessing Systems
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
A deadlock detection and recovery algorithm using the formalism of a directed graph matrix
ACM SIGOPS Operating Systems Review
Hardware/software deadlock avoidance for multiprocessor multiresource system-on-a-chip
Hardware/software deadlock avoidance for multiprocessor multiresource system-on-a-chip
A Novel {O(n)} Parallel Banker's Algorithm for System-on-a-Chip
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Performance of commercial multimedia workloads on the Intel Pentium 4: A case study
Computers and Electrical Engineering
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
In this article, a brand new method of determining deadlock is presented. Most previous deadlock detection methods are algorithmic in the sense that they usually leverage some forms of Resource Allocation Graph (RAG) representations and then algorithms are devised to manipulate such representations in order to detect deadlock using information contained in the graph. Different from all previous methods, the proposed method actualizes the RAG with a digital circuit and uses it as a token-transmitting network. By supplying special input signals (tokens) to the network and observing the output tokens from the network, it is easier to identify which process nodes are reachable from each resource node in the graph. Using the reachability information, deadlock can be detected immediately. The time required to obtain the reachability information is determined by how fast the combinational circuit operates. Compared with previous algorithmic methods, the proposed deadlock detection can be deemed instant. We show that the proposed method is an order of magnitude faster than the previous fastest hardware mechanism and several orders of magnitude faster than traditional software-based algorithms.