Formal verification of distributed deadlock detection algorithms

The problem of distributed deadlock detection has undergone extensive study. Formal verification of deadlock detection algorithms in distributed systems is an area of research that has largely been ignored. Instead, most proposed distributed deadlock detection algorithms have used informal or intuitive arguments, simulation or just neglect the entire aspect of verification of correctness; As a consequence, many of these algorithms have been shown incorrect. This research will abstract the notion of deadlock in terms of a temporal logic of actions and discuss the invariant and eventuality properties. The contributions of this research are the development of a distributed deadlock detection algorithm and the formal verification of this algorithm

Self-stabilizing deadlock algorithms in distributed systems

A self-stabilizing system is a network of processors, which, when started from an arbitrary (and possibly illegal) initial state, always returns to a legal state in a finite number of steps. Self-stabilization is an evolving paradigm in fault-tolerant computing. This research will be the first time self-stabilization is used in the areas of deadlock detection and prevention. Traditional deadlock detection algorithms have a process initiate a probe. If that probe travels around the system and is received by the initiator, there is a cycle in the system, and deadlock is detected. In order to prevent deadlocks, algorithms usually rank nodes in order to determine if an added edge will create a deadlock in the system. In a self-stabilizing system, perturbances are automatically dealt with. For the deadlock model, the perturbances in the system are requests and releases of resources. So, the self-stabilizing deadlock detection algorithm will automatically detect a deadlock when a request causes a cycle in the wait-for graph. The self-stabilizing prevention algorithm prevents deadlocks in a similar manner. The self-stabilizing algorithms do not have to be initiated by any process because the requests and releases create a perturbance which is dealt with automatically

Algon: a framework for supporting comparison of distributed algorithm performance

Programmers often need to use distributed algorithms to add non-functional behaviour such as mutual exclusion, deadlock detection and termination, to a distributed application. They find the selection and implementation of these algorithms daunting. Consequently, they have no idea which algorithm will be best for their particular application. To address this difficulty the Algon framework provides a set of pre-coded distributed algorithms for programmers to choose from, and provides a special performance display tool to support choice between algorithms. The performance tool is discussed. The developer of a distributed application will be able to observe the performance of each of the available algorithms according to a set of of widely accepted and easily-understandable performance metrics and compare and contrast the behaviour of the algorithms to support an informed choice. The strength of the Algon framework is that it does not require a working knowledge of algorithmic theory or functionality in order for the developer to use the algorithms

On deadlock detection in distributed computing systems

With the advent of distributed computing systems, the problem of deadlock, which has been essentially solved for centralized computing systems, has reappeared. Existing centralized deadlock detection techniques are either too expensive or they do not work correctly in distributed computing systems. Although several algorithms have been developed specifically for distributed systems, the majority of them have also been shown to be inefficient or incorrect. A new algorithm is proposed which is more efficient than any existing distributed deadlock detection algorithm. (Author)supported in part by the Foundation Research Program of the Naval Postgraduate School with funds provided the by Chief of Naval Researchhttp://archive.org/details/ondeadlockdetect00badaApproved for public release; distribution is unlimited

Avoid Deadlock Resource Allocation (ADRA) Model V VM-out-of-N PM: Avoid Deadlock Resource Allocation (ADRA) Model V VM-out-of-N PM

This paper presents an avoid deadlock resource allocation (ADRA) for model V VM-out-of-N PM since cloud computing is a new computing paradigm composed of grid computing, distributed computing and utility concepts. Cloud computing presents a different resource allocation paradigm than either grids or distributed systems. Cloud service providers dynamically scale virtualized computing resources as a service over the internet. Due to variable number of users and limited resources, cloud is prone to deadlock at very large scale. Resource allocation and the associated deadlock avoidance is problem originated in the design and the implementation of the distributed computing, grid computing. In this paper, a new concept of free space cloud is proposed to avoid deadlock by collecting available free resource from all allocated users. New algorithms are developed for allocating multiple resources to competing services running in virtual machines on a heterogeneous distributed platform.  An experiment is tested in CloudSim. The performance of resource pool manager is evaluated by using CloudSim and resource utilization and indicating good results

Implementing deadlock detection in distributed processing, 1985

Many protocols have been published on the topic of deadlock detection in distributed processing. A survey has been made on four of these varied schemes. The method of 'distributed locking and distributed deadlock detection protocol' has been selected for implementation. Data structures and various routines for this particular protocol have been fully developed, and the resulting program exhaustively tested. In all test cases, results were positive and based on these results, we believe we have succeeded in implementing a deadlock detecting scheme for distributed processing