A distributed scheme for detecting communication deadlocks
IEEE Transactions on Software Engineering
Detection of stable properties in distributed applications
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
A distributed deadlock detection algorithm for CSP-like communication
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Termination Detection of Diffusing Computations in Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Graph Algorithm: Knot Detection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
A distributed algorithm for detecting resource deadlocks in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A distributed algorithm for deadlock detection and resolution
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A distributed algorithm for generalized deadlock detection
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Runtime and description of deadness errors in ADA tasking
Runtime and description of deadness errors in ADA tasking
DEBUGGING ADA TASKING PROBLEMS
DEBUGGING ADA TASKING PROBLEMS
Non-Intrusive Detection of Synchronization Errors Using Execution Replay
Automated Software Engineering
| Hi-index | 0.00 |
Distributed deadlock detection has been studied in distributed database systems and distributed timesharing operating systems, but has not been widely used in real-time systems such as Ada runtime environments. In this paper we are interested in explicitly tying the formal properties of deadlock algorithms to Ada and its runtime system. We analyze and categorize the deadlock problem in Ada environments into four levels of complexity by using Knapp's hierarchy of deadlock models. To fully support Ada semantics it is necessary to develop solutions for the most complex level. Many Ada applications, however, do not utilize all the features that Ada provides. Consequently, according to the characteristics of an application, the deadlock problem may be simplified by imposing certain restrictions on the use of Ada. We develop a series of solutions depending on the level of restriction imposed on the use of Ada and we relate those solutions to the levels of complexity associated with the theoretical models. Two algorithms related to the first two levels of complexity are presented in this paper.