Operation systems: advanced concepts
Operation systems: advanced concepts
Pthreads programming
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
A novel parallel deadlock detection algorithm and architecture
Proceedings of the ninth international symposium on Hardware/software codesign
Operating System Concepts
Introduction to Algorithms
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 new deadlock detection algorithms for distributed real-time database systems
SRDS '95 Proceedings of the 14TH Symposium on Reliable 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
Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach
Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach
Design of Liveness-Enforcing Supervisors for Flexible Manufacturing Systems Using Petri Nets
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
Current MPSoCs typically consist of less than a dozen processing units. Future MPSoCs are likely to integrate many more. With this trend, dozens of applications can be running on an MPSoC concurrently and application deadlock on MPSoCs will become a severe problem. To address the application deadlock problem in current and future MPSoCs, this article proposes a parallel multi-unit resource deadlock detection algorithm, incorporating four contributions: (1) a classification of resource events that enables each category of events to be handled efficiently, (2) a parallel node hopping mechanism that explores the entire graph exponentially in parallel to obtain information about reachable processes of every resource, (3) an innovative hardware implementation of the node hopping mechanism using bit-wise computations, and (4) proofs of correctness and run-time complexity of the proposed algorithm. Based on information about reachable processes as well as sink nodes in the graph, the proposed algorithm detects deadlock in O(1) run-time. Compared with the worst case run-time of any previous algorithm, which employs a single scheme to handle all resource events, ours is considerably reduced to O(log"2(min(m,n))) when implemented in hardware, where m and n are the number of processes and resources, respectively.