Title
Optimal admission to reader-writer systems with no queueing
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.
Year
DOI
Venue
1999
10.1016/S0167-6377(99)00058-9
Oper. Res. Lett.
Keywords
Field
DocType
request iid service time,optimal admission,optimal stationary admission policy,holding cost,unlimited number,reader–writer queues,profit rate,optimal admission control,reader-writer system,independent poisson process,database performance,poisson process,profitability
Revenue,Mathematical optimization,Database tuning,Computer science,Holding cost,Reader writer,Operations research,Real-time computing,Queueing theory,Poisson distribution,Net profit
Journal
Volume
Issue
ISSN
25
5
Operations Research Letters
Citations 
PageRank 
References 
0
0.34
2
Authors
2
Name
Order
Citations
PageRank
Tugrul Sanli110.72
Vidyadhar G. Kulkarni253960.15