Deadlock Detection and Avoidance for Shared Logical Resources
- 1 September 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-5 (5) , 465-471
- https://doi.org/10.1109/tse.1979.230185
Abstract
Logical resources are defined as shared passive entities that can be concurrently accessed by multiple processes. Concurrency restrictions depend upon the mode or manner in which a process may manipulate a resource. Models incorporating these single unit resources can be used to analyze information locking for consistency and integrity purposes. Mode compatibility is defined and used to derive dead-lock detection and avoidance methods. These methods generalize well-known deadlock results for single unit resources by permitting greater concurrency while still guaranteeing data consistency. This model is applicable to the standard shared (read-only) and exclusive (read-write) access modes as well as a useful subset of those proposed in the CODASYL DBMS report.Keywords
This publication has 12 references indexed in Scilit:
- Game interpretation of the deadlock avoidance problemCommunications of the ACM, 1977
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- Granularity of locks in a shared data basePublished by Association for Computing Machinery (ACM) ,1975
- MonitorsCommunications of the ACM, 1974
- A practical approach to managing resources and avoiding deadlocksCommunications of the ACM, 1973
- Some Deadlock Properties of Computer SystemsACM Computing Surveys, 1972
- System DeadlocksACM Computing Surveys, 1971
- Comments on prevention of system deadlocksCommunications of the ACM, 1971
- Prevention of system deadlocksCommunications of the ACM, 1969
- Avoiding deadlock in multitasking systemsIBM Systems Journal, 1968