This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A decomposition solution to a queueing network model of a distributed file system with dynamic locking
April 1986 (vol. 12 no. 4)
pp. 521-530
Anna Hac, Department of Electrical Engineering and Computer Science, The Johns Hopkins University, Baltimore, MD 21218
This paper presents a new approach to modeling file systems using queueing networks. The delays due to locking the files are modeled using service centers whose service times and probabilities of access are estimated from the values of measurable quantities. The model of a lock is based on the analysis of execution of transactions in the system. The lock for every file is modeled as a sequence of service centers. The decomposition method can be used to solve the model, which allows multiple classes of transactions and shared files to be represented. An example involving measurement data collected in a small business installation is given to compare performance measures provided by the simulation and analytic models.
Index Terms:
Delay,Servers,Analytical models,File systems,Load modeling,Probability,Business,queueing networks,Concurrency control,distributed systems,file systems,hierarchical decomposition,locking mechanisms
Citation:
Anna Hac, "A decomposition solution to a queueing network model of a distributed file system with dynamic locking," IEEE Transactions on Software Engineering, vol. 12, no. 4, pp. 521-530, April 1986, doi:10.1109/TSE.1986.6312899
Usage of this product signifies your acceptance of the Terms of Use.