Advertisement

Secondary Storage

Part of the Mathematics and Its Applications book series (MAIA, volume 39)

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.

Keywords

Service Time Busy Period Idle Period Disk System Secondary Storage 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Scientific Information Consultants 1987

Personalised recommendations