Journal ArticleDOI
An efficient deadlock avoidance technique
Reads0
Chats0
TLDR
A deadlock avoidance technique, based on a method of representing directed acyclic graphs, is presented, suitable for systems with single resources of each resource type.Abstract:
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. >read more
Citations
More filters
Patent
Methods and apparatus for bus access arbitration of nodes organized into acyclic directed graph by cyclic token passing and alternatively propagating request to root node and grant signal to the child node
TL;DR: In this article, a bus arbitration scheme is implemented in a system where an arbitrary assembly of nodes on a system bus have been resolved into an acyclic directed graph, where one node designated a root node and all other nodes have established parent/child relationships with the nodes to which they are linked.
Patent
Method and apparatus for transforming an arbitrary topology collection of nodes into an acyclic directed graph
TL;DR: In this article, a hierarchical tree structure where there is only one root node is proposed and a signaling scheme is developed in which nodes via on board communications hardware, signal all connected nodes and respond accordingly until hierarchical relationships are established.
Journal ArticleDOI
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
TL;DR: In this article, the authors present two online algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created.
Journal ArticleDOI
Design Guidelines for Deadlock-Handling Strategies in Flexible Manufacturing Systems
TL;DR: In this article, structural control policies (SCPs) are defined for real-time FMS deadlock-handling strategies based on a digraph representation of the FMS state space.
Book ChapterDOI
Deadlocks: From Exhibiting to Healing
TL;DR: The basic healing idea and its limitations, the pitfalls and how to overcome them, and experimental results are described, which are very important as any mistake is liable to actually create new deadlocks.
References
More filters
Journal ArticleDOI
Deadlock detection in distributed databases
TL;DR: A uniform model in which published algorithms can be cast is given, and the fundamental principles on which distributed deadlock detection schemes are based are presented, and a hierarchy of deadlock models is presented.
Book
Graph algorithms and NP-completeness
TL;DR: In this article, the authors present a survey of algorithms on graphs and their applications in the literature, including the following: 1. Graph Algorithms and NP-Completeness, 2. Topological sorting and the Representation Problem, 3. Transitive Closure of Acyclic Digraphs, 4. General Path Problems and Matrix Multiplication, and 5. More NP-complete Problems.
Journal ArticleDOI
The Performance of Alternative Strategies for Dealing with Deadlocks in Database Management Systems
TL;DR: It is shown that the choice of the best deadlock resolution strategy depends upon the level of data contention, the resource utilization levels, and the types of transactions, and that guidelines for selecting a deadlockresolution strategy for different operating regions are provided.
Journal ArticleDOI
A modified priority based probe algorithm for distributed deadlock detection and resolution
TL;DR: A modified, priority-based probe algorithm for deadlock detection and resolution in distributed database system is presented and appears to be errorfree.
Journal ArticleDOI
A distributed scheme for detecting communication deadlocks
TL;DR: The author presents an algorithm for detecting communication deadlocks, which does not require any storage whose size is determined by the size of the network, and hence is suitable also for an environment where processes are created dynamically.