Analysis of a replicated data base
Performance Evaluation
Stability of a queueing system with concurrent service and locking
SIAM Journal on Computing
Performance analysis of concurrent-read exclusive-write
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Capacity Bounds for Multiresource Queues
Journal of the ACM (JACM)
Concurrent control with “readers” and “writers”
Communications of the ACM
A data base replication analysis using an M/M/m queue with service interruptions
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
A Performance Comparison of Locking Methods with Limited Wait Depth
IEEE Transactions on Knowledge and Data Engineering
A vacation model for the non-saturated readers and writers system with a threshold policy
Performance Evaluation
Performance Analysis of Concurrency Control Methods
Performance Evaluation: Origins and Directions
Efficient management of idleness in storage systems
ACM Transactions on Storage (TOS)
| Hi-index | 14.98 |
An analysis of a threshold policy for scheduling readers and writers in a multiserver system and a comparison of its performance with the first-come, first-served (FCFS) policy are presented. The threshold fastest emptying (FTE) policy is analyzed in a system with writer arrivals and an infinite backlog of readers using a Markovian model as well as a vacationing server model to yield closed-form expressions for the mean writer response time and the reader throughput. The maximum throughput achieved by the TFE policy is shown to be an increasing function of K, the threshold on the number of writers in the system, which even at K=1 exceeds the maximum throughput achieved by FCFS. In a system with reader and writer arrivals (nonsaturated system), simulation is used to study and compare the mean response time for the FCFS and the TFE policies.