Multifacetted modelling and discrete event simulation
Multifacetted modelling and discrete event simulation
IEEE Transactions on Software Engineering
Operation systems: advanced concepts
Operation systems: advanced concepts
Finding a minimum feedback arc set in reducible flow graphs
Journal of Algorithms
Proceedings of the Twenty-First Annual Hawaii International Conference on Decision Support and Knowledge Based Systems Track
ACM Computing Surveys (CSUR)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Concepts and Notations for Concurrent Programming
ACM Computing Surveys (CSUR)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Compact finite difference schemes for ocean models: 1. Ocean waves
Journal of Computational Physics
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A systems framework for model management in organizations
A systems framework for model management in organizations
Structured Analysis and System Specification
Structured Analysis and System Specification
| Hi-index | 0.00 |
A graph-oriented, nonprocedural development environment in which composite programs are constructed by coupling a collection of existing component programs, the interfaces of which are defined by a fixed number of input ports and output ports, is discussed. It is shown that when the coupling graph is cyclic there is the possibility of a deadlock. A system that permits hierarchical construction of programs while testing, using a simple algebraic procedure, the resulting composite programs for communication deadlocks is presented. A decomposition-based approach to cycle enumeration is described. A formal graph-theoretic model of communication behavior for a class of atomic programs is presented. The model is then used to derive necessary and sufficient conditions for a deadlock to arise in a cycle. Techniques for dealing with deadly cycles (once identified) and improving the efficiency of their execution, once the cycles have been resolved, are described.