Summary
This paper concerns the problem of obtaining predictions of the extent to which additional core storage would improve the performance of a given paging system based on information that could be obtained from monitoring the system whilst running its normal workload.
It is shown that for a large class of replacement algorithms there are efficient techniques for producing exact predictions of the performance improvement, and that for a further class of algorithms statistical predictions can be provided.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Belady, L. A.: A study of replacement algorithms for virtual storage computers. IBM Syst. J.5, 78–101 (1966).
Mattson, R. L., Gecsei, J., Slutz, D. R., Traiger, I. W.: Evaluation techniques for storage hierarchies. IBM Syst. J.9, 78–117 (1970).
Belady, L. A., Nelson, R. A., Shedler, G. S.: An anomaly in the space-time characteristics of certain programs running in paging machines. Comm. ACM.12, 349–353 (1969).
Denning, P. J.: The working set model of program behaviour. Comm. ACM11, 323–333 (1968).
Aho, A. V., Denning, P. J., Ullman, J. D.: Principles of optimal page replacement. Computer Science Tech. Rep. No. 82, Princeton University, Jan. 1970 (to appear in J. ACM.).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Coffman, E.G., Randell, B. Performance predictions for extended paged memories. Acta Informatica 1, 1–13 (1971). https://doi.org/10.1007/BF00264288
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264288