On the modeling of read and write locks on a distributed system

  • Authors:
  • Anna Hać

  • Affiliations:
  • -

  • Venue:
  • CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new approach to estimating serialization delays in computer systems. An analytic model is introduced to describe synchronization of accesses to shared resources. The model parameters are estimated from the values of measurable quantities. The probabilities that a shared resource is locked, thereby causing other processes to wait for the resource to be accessible, are calculated, under certain assumptions, as functions of the probabilities of access and of the number of active transactions. The service times of lock servers are calculated as functions of the loads on all service centers. Performance measures applicable to the evaluation of computer systems are introduced and evaluated. An example involving a distributed file system and measurement data collected in a small business installation is given to compare performance measures provided by the simulation and analytic models.