Skip to main content

Ein Algorithmus Zur Deadlock-Entdeckung

  • Betriebsprogrammierung
  • Conference paper
  • First Online:
Rechnerstrukturen und Betriebsprogrammierung (ARCS 1970)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13))

Included in the following conference series:

  • 1917 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. HAVENDER, J.W. Avoiding deadlock in multitasking systems IBM Syst. J. 2, 7 (1968)

    Google Scholar 

  2. HABERMANN, A.N. Prevention of System Deadlocks Comm. ACM 12, 7 (July 1969), 373–377

    Article  Google Scholar 

  3. MURPHY, J.E. Resource allocation with interlock detection in a multi-task system Proc. AFIPS 1968 Fall Joint Comput. Conf., Vol. 33, Pt. 2, Thompson Book Co., Washington, D.C., pp. 1169–1176

    Google Scholar 

  4. COLLIER, W.W. System Deadlocks IBM Techn. Report TR 00-1756 (1968)

    Google Scholar 

  5. DIJKSTRA, E.W. Co-operating sequential processes. In GENUYS, F. Programming Languages. Academic Press (1968) London and New York, pp. 43–112.

    Google Scholar 

Download references

Authors

Editor information

Wolfgang Händler Peter P. Spies

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Witzel, W. (1974). Ein Algorithmus Zur Deadlock-Entdeckung. In: Händler, W., Spies, P.P. (eds) Rechnerstrukturen und Betriebsprogrammierung. ARCS 1970. Lecture Notes in Computer Science, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06815-5_148

Download citation

  • DOI: https://doi.org/10.1007/3-540-06815-5_148

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06815-0

  • Online ISBN: 978-3-540-37760-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics