Deadlock avoidance in graph-structured task systems
Existing models for deadlock detection and avoidance give practical solution only in the case of chains of independent tasks.
In this paper we propose a non enumerative approach to deadlock avoidance when the workload consists of a graph-structured task system. The avoidance algorithm is based on an extention of the Coffman and Denning deadlock model.
KeywordsImplementation Purpose Resource Type Execution Sequence Task System Precedence Graph
- Coffman, E.G. jr., Elphick, M.J., Shoshani, A. "System Deadlocks", Computing Surveys 2, (1971), 67–78.Google Scholar
- Coffman E.G.jr., Denning, P.J. "Operating Systems Theory", Prentice Hall, 1973.Google Scholar
- Habermann, A.N. "Prevention of System Deadlock", Comm. ACM 12, (1969), 373–377.Google Scholar
- Havender, J.W. "Avoiding Deadlock in Multitasking Systems", IBM Syst. J. 7, (1968), 74–84.Google Scholar
- Hebalkar, P.G. "A Graph Model for Analysis of Deadlock Prevention in Systems with Parallel Computation", Proceed. IFIP Congress (1971), 168–172.Google Scholar
- Howard, J.H. jr. "Mixed Solutions for Deadlock Problem", Comm.ACM 16, (1973), 427–430.Google Scholar
- Llewellyn, J.A. "The Deadly Embrace — a Finite State Model Approach", Computer Journal 16, (1973), 223–225.Google Scholar