ACM Computing Surveys (CSUR)
Characteristics of program localities
Communications of the ACM
Improving locality by critical working sets
Communications of the ACM
Dynamic space-sharing in computer systems
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Structure within Locality Intervals
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
WSCLOCK—a simple and effective algorithm for virtual memory management
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Page size in demand-paging systems
SIGME '73 Proceedings of the 1973 ACM SIGME symposium
Program behavior and load dependent system performance.
Program behavior and load dependent system performance.
Design and performance of future virtual memory systems using fast secondary storage
Design and performance of future virtual memory systems using fast secondary storage
Improving the performance of programs in virtual memory systems
Improving the performance of programs in virtual memory systems
Adaptive prefetching algorithm in disk controllers
Performance Evaluation
| Hi-index | 0.00 |
Some of the problems that are expected to be encountered in managing virtual memory systems using the newer-technology secondary storage devices are address. The difficulties that two proposed policies have in choosing the most economical program localities of reference to assign to primary memory are analyzed. K. Koh's (1981) criterion for examining the cyclic locality interval (CLI) hierarchy of a program and choosing the least-cost pathway is examined. Koh's criterion is designed for the case of a CLI containing a single inner CLI. The decision to descend the hierarchy is based on the cycle time of the outer CLI. If the outer CLI has two or more inner CLIs, it is possible for Koh's criterion to indicate that it is more economical to descend to one of the inner CLIs without that actually being the case. Choosing which CLI to descend to requires knowledge of its duration, and this is not generally available to the memory management system. An attempt to use Koh's criterion with the loop structure of a program in order to reduce space-time execution cost was not successful.