A study of storage partitioning using a mathematical model of locality
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
Further experimental data on the behavior of programs in a paging environment
Communications of the ACM
Dynamic program behavior under paging
ACM '66 Proceedings of the 1966 21st national conference
A Short Theory of Multiprogramming
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations
IEEE Transactions on Computers
A Modified Working Set Paging Algorithm
IEEE Transactions on Computers
Working Set and Page Fault Frequency Paging Algorithms: A Performance Comparison
IEEE Transactions on Computers
Instrumented architectural level emulation technology
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
Experimental data on page replacement algorithm
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Dynamic partitioning of the main memory using the working set concept
IBM Journal of Research and Development
An analysis of page allocation strategies for multiprogramming systems with virtual memory
IBM Journal of Research and Development
Generalized ERSS tree model: Revisiting working sets
Performance Evaluation
Cost-aware caching schemes in heterogeneous storage systems
The Journal of Supercomputing
| Hi-index | 0.01 |
Dynamic memory management is an important advance in memory allocation especially in virtual memory and multiprogramming systems. In this paper we consider the case of paged memory systems: that is, the physical and logical address space of these systems is partitioned into equal size blocks of contiguous addresses. The paged memory system has been used by many computer systems. However, the basic memory management problem of deciding which pages should be kept in the main memory to allow efficient operation without wasting space is still not sufficiently understood and has been of considerable interest. Obviously, pages should only be removed from the main memory if there is a very low probability that they will be used in the near future. The difficulty lies in trying to determine which pages to remove, without incurring difficult implementation problems at the same time.