Some Deadlock Properties of Computer Systems

Abstract

Several examples of deadlock occurring in present day computer systems are given Next, there is a discussion of the strategms which can be ~sed to deal with the deadlock problem A theory of computer systems is developed so that the terms “process” and “deadlock” can be defined. “Reusable resources” are introduced to model objects that are shared among processes, and “consumable resources” are introduced to model signals or messages passed among processes. Then a rumple graph model of computer systems m developed, and its deadlock propertms are investigated This graph model unifies a number of previous results, leads to efficient deadlock detection and prevenUon algorithms, and ~s useful for teaching purposes. © 1972, ACM. All rights reserved.