Summary
An analytical model of a simple computer storage allocation scheme is described, and its Markov nature established given certain conditions on its input and operation. Simple Markov theory is used to compute the expected storage utilisation in some example situations with small memory sizes. These are compared with the analytical closed-form results which are possible when storage relocation is allowed. Some current restrictions and possible future developments and uses of the model are outlined.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Randell, B.: A note on storage fragmentation and program segmentation. Comm. ACM 12, 365–369 (1969)
Knuth, D. E.: The art of computer programming, Vol. 1. Reading (Mass.): Addison-Wesley 1968, pp. 435–455
Feller, W.: An introduction to probability theory and its applications. 3rd edition. New York: Wiley 1968
Howard, R. A.: Dynamic programming and Markov processes. New York: MIT Technology Press/Wiley 1960
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Betteridge, T. An analytic storage allocation model. Acta Informatica 3, 101–122 (1974). https://doi.org/10.1007/BF00264032
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264032