1966/01/01 by L. A. Belady · 12 citations
Computer Science · #Advanced Data Storage Technologies #Cloud Computing and Resource Management #Distributed and Parallel Computing Systems
paper · doi:10.1147/sj.52.0078
crossref issued 1966/01/01 · crossref published 1966/01/01 · crossref published-print 1966/01/01 · openalex publication_date 1966/01/01 · crossref created 2010/04/05 · crossref deposited 2017/11/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31 · crossref indexed 2026/08/01
One of the basic limitations of a digital computer is the size of its available memory.1In most cases, it is neither feasible nor economical for a user to insist that every problem program fit into memory. The number of words of information in a program often exceeds the number of cells (i.e., word locations) in memory. The only way to solve this problem is to assign more than one program word to a cell. Since a cell can hold only one word at a time, extra words assigned to the cell must be held in external storage. Conventionally, overlay techniques are employed to exchange memory words and external-storage words whenever needed; this, of course, places an additional planning and coding burden on the programmer. For several reasons, it would be advantageous to rid the programmer of this function by providing him with a “virtual” memory larger than his program. An approach that permits him to use a sufficiently large address range can accomplish this objective, assuming that means are provided for automatic execution of the memory-overlay functions.