Deadlock avoidance in graph-structured task systems

  • M. Di Manzo
  • A. L. Frisiani
  • G. Olimpo
Parallel Processes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 65)


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.


Implementation Purpose Resource Type Execution Sequence Task System Precedence Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

6. References

  1. Coffman, E.G. jr., Elphick, M.J., Shoshani, A. "System Deadlocks", Computing Surveys 2, (1971), 67–78.Google Scholar
  2. Coffman E.G.jr., Denning, P.J. "Operating Systems Theory", Prentice Hall, 1973.Google Scholar
  3. Habermann, A.N. "Prevention of System Deadlock", Comm. ACM 12, (1969), 373–377.Google Scholar
  4. Havender, J.W. "Avoiding Deadlock in Multitasking Systems", IBM Syst. J. 7, (1968), 74–84.Google Scholar
  5. Hebalkar, P.G. "A Graph Model for Analysis of Deadlock Prevention in Systems with Parallel Computation", Proceed. IFIP Congress (1971), 168–172.Google Scholar
  6. Howard, J.H. jr. "Mixed Solutions for Deadlock Problem", Comm.ACM 16, (1973), 427–430.Google Scholar
  7. Llewellyn, J.A. "The Deadly Embrace — a Finite State Model Approach", Computer Journal 16, (1973), 223–225.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • M. Di Manzo
    • 1
  • A. L. Frisiani
    • 1
  • G. Olimpo
    • 2
  1. 1.Istituto di ElettrotecnicaUniversità di GenovaItaly
  2. 2.Laboratorio per le Tecnologie Didattiche Consiglio Nazionale RicercheGenovaItaly

Personalised recommendations