Year: 1971
Type: article
Abstract: A problem of increasing importance in the design of large multiprogramming systems is the, so-called, deadlock or deadly-embrace problem. In this article we survey the work that has been done on the treatment of deadlocks from both the theoretical and practical points of view.
Source: ACM Computing Surveys
Authors: E. G. Coffman, M. Elphick, A. Shoshani
Institutions: Pennsylvania State University, Newcastle University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2294580796
