Optimal admission to reader-writer systems with no queueing

Authors:
Tugrul Sanli;Vidyadhar G. Kulkarni
Affiliations:
Department of Operations Research, University of North Carolina, Chapel Hill, NC 27599-3180, USA;Department of Operations Research, University of North Carolina, Chapel Hill, NC 27599-3180, USA
Venue:
Operations Research Letters
Year:
1999

Citing 4
Cited 0

Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics

Journal of the ACM (JACM)
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Comparison of stability and queueing times for reader-writer queues

Performance Evaluation
Modeling and analysis of stochastic systems

Modeling and analysis of stochastic systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a reader-writer system with no queueing. An unlimited number of readers can be processed in parallel, whereas writers are processed one at a time. Both readers and writers arrive according to independent Poisson processes and request iid service times. Every admitted customer generates a revenue and a holding cost. We derive optimal stationary admission policies that depend only on the number of readers and writers, to maximize the total expected discounted net profit, and the long-run net profit rate.