Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Operating system concepts (2nd ed.)
Operating system concepts (2nd ed.)
A distributed scheme for detecting communication deadlocks
IEEE Transactions on Software Engineering
Local Distributed Deadlock Detection by Cycle Detection and Clusterng
IEEE Transactions on Software Engineering - Special issue on distributed systems
The Performance of Alternative Strategies for Dealing with Deadlocks in Database Management Systems
IEEE Transactions on Software Engineering
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
A Distributed Deadlock Detection and Resolution Algorithm and its Correctness Proof
IEEE Transactions on Software Engineering
A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution
IEEE Transactions on Software Engineering
The Performance of an Efficient Distributed Synchronization and Recovery Algorithm
The Journal of Supercomputing
An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model
IEEE Transactions on Software Engineering
A novel deadlock avoidance algorithm and its hardware implementation
Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
A Novel {O(n)} Parallel Banker's Algorithm for System-on-a-Chip
IEEE Transactions on Parallel and Distributed Systems
International Journal of Information and Communication Technology
Deadlocks: From Exhibiting to Healing
Runtime Verification
A new approach to incremental topological ordering
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A transformation to provide deadlock-free programs
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
A batch algorithm for maintaining a topological order
ACSC '10 Proceedings of the Thirty-Third Australasian Conferenc on Computer Science - Volume 102
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
A new approach to deadlock avoidance in embedded system
ICESS'04 Proceedings of the First international conference on Embedded Software and Systems
SAMOS'05 Proceedings of the 5th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
On deadlocks and fairness in self-organizing resource-flow systems
ARCS'10 Proceedings of the 23rd international conference on Architecture of Computing Systems
Proactive dynamic resource management in virtualized data centers
Proceedings of the 2nd International Conference on Energy-Efficient Computing and Networking
| Hi-index | 14.98 |
A deadlock avoidance technique, based on a method of representing directed acyclic graphs, is presented. This technique is suitable for systems with single resources of each resource type. The deadlock avoidance problem considered is the problem of changing a directed acyclic graph while keeping it acyclic. The resource allocation algorithm involves three operations on edges corresponding to release of a resource from a process, unsuccessful allocation of a resource to a process, and successful allocation of a resource to a process, where the allocations include a previous detection of cycles. A path matrix representation is used, making it possible to detect cycles efficiently. The low cost of cycle detection can amortize the cost of the other operations and linear (or even constant) amortized time for one operation can be attained in dense systems.