Virtual Memory

@article{Denning1996VirtualM,
  title={Virtual Memory},
  author={Peter J. Denning},
  journal={ACM Comput. Surv.},
  year={1996},
  volume={28},
  pages={213-216}
}
Virtual memory is the simulation of a storage space so large that programmers do not need to reprogram or recompile their works when the capacity of a local memory or the configuration of a network changes. The name, borrowed from optics, recalls the virtual images formed by mirrors and lenses--images that are not there but behave as if they are. The designers of the Atlas Computer at the University of Manchester invented virtual memory in the 1950s to eliminate a looming programming problem… Expand
Architectural and Operating System Support for Virtual Memory
This book provides computer engineers, academic researchers, new graduate students, and seasoned practitioners an end-to-end overview of virtual memory. We begin with a recap of foundational conceptsExpand
A look at several memory management units, TLB-refill mechanisms, and page table organizations
TLDR
Comparing several virtual memory designs, including combinations of hierarchical and inverted page tables on hardware-managed and software-managed translation lookaside buffers (TLBs), shows that systems are fairly sensitive to TLB size and that VM overhead is roughly twice what was thought. Expand
Memory systems
TLDR
Cache memories are a general solution to improving the performance of a memory system by placing smaller faster memories in front of larger, slower, and cheaper memories to approach that of a perfect memory system—at a reasonable cost. Expand
Revisiting virtual memory
TLDR
The merged-associative TLB is proposed to avoid such pathologies and reduce TLB miss rate by up to 45% through dynamic aggregation of TLB resources across page sizes, and large pages are likely to be more appropriate than direct segments to reduceTLB misses under frequent memory allocations/deallocations. Expand
Software-oriented memory-management design
TLDR
A software-oriented design for a virtual memory management system is explored, which is centered around a virtual cache hierarchy managed by the operating system, and is shown to be useful for real-time systems, shared-memory multiprocessors, and architecture emulation. Expand
Address spaces and virtual memory: specification, implementation, and correctness
TLDR
This thesis formulates and proves a virtual memory simulation theorem for an abstract multiprocessor and applies the theorem to a concrete implementation, a VAMP with a singlelevel address translation mechanism and an exemplary page fault handler, and shows how to extend the architecture and proofs to support TLBs, multi-level translation, and multip rocessing. Expand
Organizing arrays for paged memory systems
TLDR
What is presented here is what is believed to be a balanced discussion of the issues surrounding software tiling, so the software engineer can make an informed decision about adopting the software tiler technique. Expand
Segmented Addressing Solves the Virtual Cache Synonym Problem
TLDR
This report describes a virtual memory system developed for amented microarchitecture and presents the following benefits derived from such an organization: (a) the need to flush virtual caches can be eliminated, (b) virtual cache consistency management can be eliminate, and (c) page table space requirements can be cut in half by eliminating theneed to replicate page table entries for shared pages. Expand
CMCP: a novel page replacement policy for system level hierarchical memory management on many-cores
TLDR
This paper proposes Core-Map Count based Priority (CMCP) page replacement policy, which exploits the auxiliary knowledge of the number of mapping CPU cores of each page and prioritizes them accordingly and can avoid TLB invalidations for page usage statistic purposes altogether. Expand
Memory Systems: Cache, DRAM, Disk
Is your memory hierarchy stopping your microprocessor from performing at the high level it should be? Memory Systems: Cache, DRAM, Disk shows you how to resolve this problem. The book tells youExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 76 REFERENCES
Virtual Memory
TLDR
Two principal methods for implementing virtual memory, segmentation and paging, are compared and contrasted and are shown to be controllable by a proper combination of hardware and memory management policies. Expand
The multics virtual memory
TLDR
It is shown how the Multics software achieves the effect of a large segmented main memory through the use of the GE 645 segmentation and paging hardware. Expand
A use of fast and slow memories in list-processing languages
A scheme is described which permitting a substantial increase in memory space utilized to store list-structured data. It consists in reducing to one level a nonhomogeneous store composed of fastExpand
The Cambridge CAP computer and its operating system (Operating and programming systems series)
The need for hardware memory protection was first met when operating systems which permitted the running of users’ programs written in a variety of languages, including assembly language, came intoExpand
Effects of scheduling on file memory operations
TLDR
It is clear that the demand placed on the file memory system is extraordinarily heavy; and it is essential that every part of the computing system interacting with file memory do so smoothly and efficiently. Expand
Virtual memory, processes, and sharing in MULTICS
TLDR
The Manchester University ATLAS Operating System Part 1: The Internal Organization and Experience using a time-sharing multiprogramming system with dynamic address relocation hardware. Expand
Considerations in the design of a multiple computer system with extended core storage
TLDR
This paper discusses the recent innovation of the use of large quantities of addressable (but not executable) fast random access memory in order to heighten the multiprogramming performance of a multicomputer system. Expand
Segmentation and the Design of Multiprogrammed Computer Systems
TLDR
The segmentation of procedures and data forms a model of program structure that is the basis of an address mapping function which will be a valuable feature of future computer systems. Expand
A Logic-in-Memory Computer
  • H. Stone
  • Computer Science
  • IEEE Transactions on Computers
  • 1970
TLDR
The logic-in-memory computer points to a new direction for achieving orders of magnitude increase in computer performance, since the computer is specifically organized for large-scale integration, the increased performance might be obtained for a comparatively small dollar cost. Expand
Stochastic evaluation of a static storage allocation
TLDR
An objective rule of evaluation is developed of the efficiency of a specific allocation of a given library as a function of the frequency of calls on each of the programs and data groups in the library. Expand
...
1
2
3
4
5
...