ACM Computing Surveys (CSUR)
The nucleus of a multiprogramming system
Communications of the ACM
The structure of the “THE”-multiprogramming system
Communications of the ACM
A scheduling philosophy for multiprocessing systems
Communications of the ACM
Compact finite difference schemes for ocean models: 1. Ocean waves
Journal of Computational Physics
On deadlock in computer systems
On deadlock in computer systems
A model for deadlock-free resource allocation
A model for deadlock-free resource allocation
A top-down, laboratory based operating system course
SIGCSE '77 Proceedings of the seventh SIGCSE technical symposium on Computer science education
A model highlighting the security of operating systems
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Verifying formal specifications of synchronous processes
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
| Hi-index | 0.00 |
First, a “meta theory” of computer systems is developed so that the terms “process” and “deadlock” can be defined. Next, “reusable resources” are introduced to model objects which are shared among processes, and “consumable resources” are introduced to model signals or messages passed among processes. Then a simple graph model of computer systems is developed, and its deadlock properties are investigated. This graph model is useful for teaching purposes, unifies a number of previous results, and leads to efficient deadlock detection and prevention algorithms.