Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

On the Modeling of Shared Resources by Queuing Networks with Serialization Delays

Anna Hac

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-83-153
November 1983

http://www.eecs.berkeley.edu/Pubs/TechRpts/1983/CSD-83-153.pdf

This paper presents a new approach to estimating serialization delays in computer systems. Two types of models are introduced to describe synchronization of accesses to shared resources using simulation and numerical methods, respectively. The model parameters are estimated from the values of measurable quantities. For the analytic models, 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.


BibTeX citation:

@techreport{Hac:CSD-83-153,
    Author = {Hac, Anna},
    Title = {On the Modeling of Shared Resources by Queuing Networks with Serialization Delays},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1983},
    Month = {Nov},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1983/6339.html},
    Number = {UCB/CSD-83-153},
    Abstract = {This paper presents a new approach to estimating serialization delays in computer systems. Two types of models are introduced to describe synchronization of accesses to shared resources using simulation and numerical methods, respectively. The model parameters are estimated from the values of measurable quantities. For the analytic models, 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.}
}

EndNote citation:

%0 Report
%A Hac, Anna
%T On the Modeling of Shared Resources by Queuing Networks with Serialization Delays
%I EECS Department, University of California, Berkeley
%D 1983
%@ UCB/CSD-83-153
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1983/6339.html
%F Hac:CSD-83-153