A use of fast and slow memories in list-processing languages
Communications of the ACM
Dynamic storage allocation systems
Communications of the ACM
Resource management for a medium scale time-sharing operating system
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Structure of a LISP system using two-level storage
Communications of the ACM
The simulation of time sharing systems
Communications of the ACM
Microprogamming under a page on demand strategy
Communications of the ACM
Dynamic program behavior under paging
ACM '66 Proceedings of the 1966 21st national conference
A study of the effect of user program optimization in a paging system
SOSP '67 Proceedings of the first ACM symposium on Operating System Principles
Bulk core in a 360/67 time-sharing system
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
An Adaptive Replacement Algorithm for Paged-Memory Computer Systems
IEEE Transactions on Computers
On the Paging Performance of Array Algorithms
IEEE Transactions on Computers
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Experimental data on page replacement algorithm
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Virtual storage and virtual machine concepts
IBM Systems Journal
Simulation of a model of paging system performance
IBM Systems Journal
Evaluation techniques for storage hierarchies
IBM Systems Journal
Dependable and Historic Computing
| Hi-index | 0.01 |
The method of storage allocation known as "demand paging," first introduced by the designers of the Atlas computer, has a very appealing conceptual simplicity. Furthermore, the possibility that this technique could be used to allow programmers to ignore the problems of organizing information flow between working storage and one or more levels of backing storage was, to say the least, very tempting.