{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:21:19Z","timestamp":1649024479745},"reference-count":23,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0166-5316(96)00060-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:05:40Z","timestamp":1027641940000},"page":"195-215","source":"Crossref","is-referenced-by-count":1,"title":["Comparison of stability and queueing times for reader-writer queues"],"prefix":"10.1016","volume":"30","author":[{"given":"L.C.","family":"Puryear","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.G.","family":"Kulkarni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0166-5316(96)00060-0_BIB1","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/1035332.1035309","article-title":"A data base replication analysis using an M\/M\/m queue with service interruptions","volume":"11","author":"Baccelli","year":"1983","journal-title":"Performance Evaluation Rev."},{"key":"10.1016\/S0166-5316(96)00060-0_BIB2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-4149(87)90179-7","article-title":"Construction of the stationary regime of queues with locking","volume":"26","author":"Baccelli","year":"1987","journal-title":"Stochastic Process. Appl."},{"issue":"1","key":"10.1016\/S0166-5316(96)00060-0_BIB3","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/TSE.1981.234510","article-title":"Optimization of the number of copies in a distributed database","volume":"7","author":"Coffman","year":"1981","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/S0166-5316(96)00060-0_BIB4","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/0166-5316(81)90044-4","article-title":"An analysis of parallel-read sequential-write systems","volume":"1","author":"Coffman","year":"1981","journal-title":"Performance Evaluation"},{"issue":"8","key":"10.1016\/S0166-5316(96)00060-0_BIB5","doi-asserted-by":"crossref","DOI":"10.1109\/TAC.1987.1104697","article-title":"Optimal control of a queueing system with simultaneous service requirements","volume":"32","author":"Courcoubetis","year":"1987","journal-title":"IEEE Trans. Automat. Control"},{"issue":"1","key":"10.1016\/S0166-5316(96)00060-0_BIB6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1137\/0216014","article-title":"Stability of a queueing system with concurrent service and locking","volume":"16","author":"Courcoubetis","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-5316(96)00060-0_BIB7","series-title":"Principles of the Monte Carlo method","author":"Fishman","year":"1993"},{"key":"10.1016\/S0166-5316(96)00060-0_BIB8","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1137\/0907002","article-title":"An exhaustive analysis of multiplicative congruential random number generators with modulus 231 \u2014 1","volume":"7","author":"Fishman","year":"1986","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/S0166-5316(96)00060-0_BIB9","article-title":"An implementation of the batch means method","author":"Fishman","year":"1993"},{"key":"10.1016\/S0166-5316(96)00060-0_BIB10","series-title":"Proc. ACM Sigmetrics Conf. on Measurement and Modelling of Computer Systems","first-page":"106","article-title":"Approximate analysis of reader and writer access to a shared resource","author":"Johnson","year":"1990"},{"key":"10.1016\/S0166-5316(96)00060-0_BIB11","author":"Kulkarni","year":"1995"},{"key":"10.1016\/S0166-5316(96)00060-0_BIB12","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01189233","article-title":"A reader-writer queue with reader preference","volume":"15","author":"Kulkarni","year":"1994","journal-title":"Queueing Systems Theory Appl."},{"key":"10.1016\/S0166-5316(96)00060-0_BIB13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01148941","article-title":"A reader-writer queue with alternating exhaustive priorities","volume":"19","author":"Kulkarni","year":"1995","journal-title":"Queueing Systems Theory Appl."},{"issue":"4","key":"10.1016\/S0166-5316(96)00060-0_BIB14","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1137\/0214072","article-title":"Probabilistic models and asymptotic results for concurrent processing with exclusive and non-exclusive locks","volume":"14","author":"Mitra","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/S0166-5316(96)00060-0_BIB15","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1145\/1634.2509","article-title":"Probabilistic models of database locking: Solutions, computational algorithms, and asymptotics","volume":"31","author":"Mitra","year":"1984","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0166-5316(96)00060-0_BIB16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-5316(85)90008-2","article-title":"Analysis of a replicated database","volume":"5","author":"Nelson","year":"1985","journal-title":"Performance Evaluation"},{"key":"10.1016\/S0166-5316(96)00060-0_BIB17","series-title":"Conf. Proc. Symposium on Computer-Communications Networks and Teletraffic","article-title":"A queueing analysis of a multiprocessor system with shared memory","author":"Omahen","year":"1972"},{"key":"10.1016\/S0166-5316(96)00060-0_BIB18","article-title":"Stability and queueing-time analysis of reader-writer queues","author":"Puryear","year":"1995"},{"issue":"1","key":"10.1016\/S0166-5316(96)00060-0_BIB19","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/107972.107989","article-title":"Performance analysis of concurrent-read exclusive-write","volume":"19","author":"Reiman","year":"1991","journal-title":"Performance Evaluation Rev."},{"issue":"3","key":"10.1016\/S0166-5316(96)00060-0_BIB20","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1145\/3828.3831","article-title":"A mean value performance model for locking in databases: The no waiting case","volume":"32","author":"Tay","year":"1985","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0166-5316(96)00060-0_BIB21","article-title":"Performance evaluation of a threshold policy for scheduling readers and writers","volume":"42","author":"Thomasian","year":"1993","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-5316(96)00060-0_BIB22","author":"Ullman","year":"1982"},{"key":"10.1016\/S0166-5316(96)00060-0_BIB23","article-title":"Incorporating a dynamic batch size selection mechanism in a fixed-sample-size batch means procedure","author":"Yarberry","year":"1993"}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531696000600?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531696000600?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T09:50:25Z","timestamp":1555494625000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531696000600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0166531696000600"],"URL":"https:\/\/doi.org\/10.1016\/s0166-5316(96)00060-0","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}