ACM Computing Surveys (CSUR)
The structure of the “THE”-multiprogramming system
Communications of the ACM
Compact finite difference schemes for ocean models: 1. Ocean waves
Journal of Computational Physics
Synchronization in a parallel-accessed data base
Communications of the ACM
Programming semantics for multiprogrammed computations
Communications of the ACM
Concurrency in database systems: a simulation study
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
A model of the performance of a rollback algorithm
ACM '79 Proceedings of the 1979 annual conference
Avoiding deadlock in distributed data bases
ACM '74 Proceedings of the 1974 annual conference - Volume 1
A graduate course in database management
ACM SIGMOD Record
Database sharing: an efficient mechanism for supporting concurrent processes
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
| Hi-index | 0.00 |
It is the purpose of this paper to examine the problems of contention which arise naturally when a number of programs are granted simultaneous access to a database for the purpose of update as well as inquiry. A LOCK-UNLOCK mechanism, applied at the group (or record) level is assumed. Incremental allocation of groups is permitted; hence deadlocks are possible. Of particular interest are the frequencies of three events: 1) Interference 2) Roadblock 3) Deadlock While none of these events constitutes a threat to the integrity of the database, each is a potential contributor to degraded performance. The justification of a LOCK-UNLOCK mechanism is thus predicated on acceptably low frequencies for each of the foregoing events. To measure these frequencies, a simulation study was undertaken. The results of this study, together with a description of the simulation, are presented.