Virtual Memory
Peter J. Denning · ACM Computing Surveys · 1970
The need for automatic storage allocation arises from desires for program modularity, machine independence, and resource sharing.Virtual memory is an elegant way of achieving these objectives.In a virtual memory, the addresses a program may use to identify information are distinguished from the addresses the memory system uses to identify physical storage sites, and program-generated addresses are translated automatically to the corresponding machine addresses.Two principal methods for implementing virtual memory, segmentation and paging, are compared and contrasted.Many contemporary implementations have experienced one or more of these problems: poor utilization of storage, thrashing, and high costs associated with loading information into memory.These and subsidiary problems are studied from a theoretic view, and are shown to be controllable by a proper combination of hardware and memory management policies.
Cited by 406 works. doi:10.1145/356571.356573 Open-access PDF
Authors
References
- Segmentation and the Design of Multiprogrammed Computer Systems
- Programming semantics for multiprogrammed computations
- The working set model for program behavior
- Program and Addressing Structure in a Time-Sharing Environment
- Program organization and record keeping for dynamic storage allocation
- Dynamic storage allocation in the Atlas computer, including an automatic use of a backing store
- Structure of a LISP system using two-level storage
- The linking segment subprogram language and linking loader
- Dynamic storage allocation systems
- Resource management for a medium scale time-sharing operating system