Author:
Denning Peter J.,Kahn Kevin C.
Abstract
A program model can be regarded as decomposible into two main parts. The macromodel captures the phase-transition behavior by specifying locality sets and their associated reference intervals (phases). The micromodel captures the reference patterns within phases. A semi-Markov model can be used at the macro level, while one of the simple early models (such as the random-reference or LRU stack) can be used at the micro level. This paper shows that, even in simplest form, this type of model is capable of reproducing known properties of empirical lifetime functions. A micromodel, alone without a macromodel, is incapable of doing so.
Publisher
Association for Computing Machinery (ACM)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Online Working Set Change Detection with Constant Complexity;The International Symposium on Memory Systems;2021-09-27
2. A Relational Theory of Locality;ACM Transactions on Architecture and Code Optimization;2019-08-20
3. Strategy independent program restructuring using the critical reference principle;Performance Evaluation;1984-05
4. Untersuchungen zu Prepaging-Verfahren;Informatik-Fachberichte;1980
5. References;Decomposability;1977