Abstract
Our first goal is to provide a FCFS (first-come-first-served) queueing analysis sufficiently general to embrace the detailed structure of a large majority of existing systems. The parameters of the mathematical model include a stationary, discrete probability distribution describing the patterns by which requests address information on secondary storage devices, where successive addresses are also allowed to form a first-order Markov chain. Such patterns normally influence system performance, and they are determined by the mechanism that allocates specific storage locations to records (units of information). Thus, in the calculation of conventional performance measures we refer to essentially combinatorial problems in which the effects of different record allocations are studied.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1987 Scientific Information Consultants
About this chapter
Cite this chapter
(1987). Secondary Storage. In: Stochastic Analysis of Computer Storage. Mathematics and Its Applications, vol 39. Springer, Dordrecht. https://doi.org/10.1007/978-0-585-27373-0_6
Download citation
DOI: https://doi.org/10.1007/978-0-585-27373-0_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-277-2515-8
Online ISBN: 978-0-585-27373-0
eBook Packages: Springer Book Archive