Stochastic Analysis of Computer Storage

Over the past 20 years the extensive research in methods of processor allocation has brought this aspect of computer operation to a point where it is relatively well understood. However, the mathematical models analyzed have been simplistic, because the critical influence of storage requirements has largely been ignored. In contrast, while there have been a number of significant contributions, the analysis of models of storage allocation, and more importantly models combining both storage and processor allocation, is still a young and developing research area.

In this work we focus on the analysis of processes arising in models of storage allocation. More precisely, we concentrate on stochastic models in which there are sequences of "arrivals" and "departures" in a realistic dynamic setting. The arrivals may correspond directly to requests for storage which subsequently depart in the sense that the space allocated to them is again made available to other requests. The correspondence to requests may also be implicit as in sequences of references to information, e.g. program data, where a request for storage space is associated with any reference to information not currently allocated primary storage.