Home → Magazine Archive → March 1983 (Vol. 26, No. 3) → On the modeling of parallel access to shared data → Abstract

On the modeling of parallel access to shared data

By A. Chesnais, E. Gelenbe, I. Mitrani

Communications of the ACM, Vol. 26 No. 3, Pages 196-202

Save PDF
A model is constructed of a database that can be accessed and modified concurrently by a number of users, and an approximate solution is presented. The resource allocation policies considered involve dynamic acquisition of entities and locking; deadlock is avoided by limiting the number of consecutive attempts to acquire a particular entity. The accuracy of the approximation is evaluated by simulations. Several generalizations aimed at improving the practicality of the model are described.

The full text of this article is premium content


No entries found