article

Performance predictions for extended paged memories

Authors:

E. G. Coffman, Jr.,

B. RandellAuthors Info & Claims

Acta Informatica, Volume 1, Issue 1

Pages 1 - 13

https://doi.org/10.1007/BF00264288

Published: 01 March 1971 Publication History

Abstract

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.

References

[1]

Belady, L. A.: A study of replacement algorithms for virtual storage computers. IBM Syst. J.5, 78---101 (1966).

Digital Library

Google Scholar

[2]

Mattson, R. L., Gecsei, J., Slutz, D. R., Traiger, I. W.: Evaluation techniques for storage hierarchies. IBM Syst. J.9, 78---117 (1970).

Digital Library

Google Scholar

[3]

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).

Digital Library

Google Scholar

[4]

Denning, P. J.: The working set model of program behaviour. Comm. ACM11, 323---333 (1968).

Crossref

Google Scholar

[5]

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.).

Crossref

Google Scholar

Cited By

View all

Hoare C(2021)Communicating Sequential ProcessesTheories of Programming10.1145/3477355.3477364(157-186)Online publication date: 4-Oct-2021
https://dl.acm.org/doi/10.1145/3477355.3477364
Floyd R(2007)The paradigms of programmingACM Turing award lectures10.1145/1283920.1283934Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1145/1283920.1283934
Kaplan SSmaragdakis YWilson P(2003)Flexible reference trace reduction for VM simulationsACM Transactions on Modeling and Computer Simulation10.1145/778553.77855413:1(1-38)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.1145/778553.778554
Show More Cited By

Recommendations

Stack Replacement Algorithms for Two-Level Directly Addressable Paged Memories

In this paper we consider the application of the stack algorithm concept to a two-level paged storage hierarchy in which both levels are directly addressable by the central processor. Since both levels are directly addressable, pages need not reside in ...
Improving performance predictions by accounting for the accuracy of composed performance models
QoSA '12: Proceedings of the 8th international ACM SIGSOFT conference on Quality of Software Architectures

Performance predictions on the software architecture level support the design and evaluation of component-based systems. Composable and parameterized models are used in current prediction approaches for reasoning. The actual model for an influencing ...
A comparative analysis of performance improvement schemes for cache memories

There have been numerous techniques proposed in the literature that aim to improve the performance of cache memories by reducing cache conflicts. These techniques were proposed over the past decade and each proposal independently claimed to reduce ...

Comments

Information & Contributors

Information

Published In

Acta Informatica Volume 1, Issue 1

March 1971

78 pages

ISSN:0001-5903

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 March 1971

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

44
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hoare C(2021)Communicating Sequential ProcessesTheories of Programming10.1145/3477355.3477364(157-186)Online publication date: 4-Oct-2021
https://dl.acm.org/doi/10.1145/3477355.3477364
Floyd R(2007)The paradigms of programmingACM Turing award lectures10.1145/1283920.1283934Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1145/1283920.1283934
Kaplan SSmaragdakis YWilson P(2003)Flexible reference trace reduction for VM simulationsACM Transactions on Modeling and Computer Simulation10.1145/778553.77855413:1(1-38)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.1145/778553.778554
Malik M(2000)Technical opinion: on the perils of programmingCommunications of the ACM10.1145/355112.35513043:12(95-97)Online publication date: 1-Dec-2000
https://dl.acm.org/doi/10.1145/355112.355130
Morrison RAtkinson MBrown ADearle A(1988)Bindings persistent programming languagesACM SIGPLAN Notices10.1145/44326.4432823:4(27-34)Online publication date: 1-Apr-1988
https://dl.acm.org/doi/10.1145/44326.44328
Khoshafian SCopeland G(1986)Object identityACM SIGPLAN Notices10.1145/960112.2873921:11(406-416)Online publication date: 1-Jun-1986
https://dl.acm.org/doi/10.1145/960112.28739
Khoshafian SCopeland G(1986)Object identityConference proceedings on Object-oriented programming systems, languages and applications10.1145/28697.28739(406-416)Online publication date: 1-Jun-1986
https://dl.acm.org/doi/10.1145/28697.28739
Alanko THaikala IKutvonen PSevcik KGraham GNutt G(1980)Methodology and empirical results of program behaviour measurementsProceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation10.1145/800199.806150(55-66)Online publication date: 28-May-1980
https://dl.acm.org/doi/10.1145/800199.806150
Alanko THaikala IKutvonen P(1980)Methodology and empirical results of program behaviour measurementsACM SIGMETRICS Performance Evaluation Review10.1145/1009375.8061509:2(55-66)Online publication date: 28-May-1980
https://dl.acm.org/doi/10.1145/1009375.806150
Lauer HSatterthwaite EBauer FStucki LLehman M(1979)The impact of mesa on system designProceedings of the 4th international conference on Software engineering10.5555/800091.802937(174-182)Online publication date: 17-Sep-1979
https://dl.acm.org/doi/10.5555/800091.802937
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Stack Replacement Algorithms for Two-Level Directly Addressable Paged Memories

Improving performance predictions by accounting for the accuracy of composed performance models

A comparative analysis of performance improvement schemes for cache memories

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations