By Topic

Regenerative Simulation of a Queuing Model of an Automated Tape Library

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lavenberg, S.S. ; IBM Research Division Laboratory, Monterey and Cottle Roads, San Jose, California 95193, USA ; Slutz, D.R.

Recently, techniques have been developed for estimating confidence intervals when simulating stochastic systems having a regenerative structure. These techniques are applied to the simulation of a queuing model of a computer system's automated tape library. Theoretical and practical issues related to the application of these techniques are addressed. An interesting feature of the automated tape library represented in the queuing model is that certain queues have finite capacity; when these queues are filled to capacity certain services are prevented from occurring. The regenerative techniques are used in conjunction with multiple comparison procedures to make statistically valid statements about the effect of the finite queue capacities on performance.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:19 ,  Issue: 5 )