Database sharing
- 1 January 1972
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 147-163
- https://doi.org/10.1145/800295.811489
Abstract
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.This publication has 0 references indexed in Scilit: