DMCA
A New Virtual Memory Implementation for Berkeley UNIX (1986)
| Venue: | EUUG Conference Proceedings (Autumn |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Mckusick86anew,
author = {Marshall Kirk Mckusick and Michael J. Karels},
title = {A New Virtual Memory Implementation for Berkeley UNIX},
booktitle = {EUUG Conference Proceedings (Autumn},
year = {1986},
pages = {451--458}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
With the cost per byte of memory approaching that of the cost per byte for disks, and with file systems increasingly distant from the host machines, a new approach to the implementation of virtual memory is necessary. Rather than preallocating swap space which limits the maximum virtual memory that can be supported to the size of the swap area, the system should support virtual memory up to the sum of the sizes of physical memory plus swap space. For systems with a local swap disk, but remote file systems, it may be useful to use some of the memory to keep track of the contents of the swap space to avoid multiple fetches of the same data from the file system. The new implementation should also add new functionality. Processes should be allowed to have large sparse address spaces, to map files into their address spaces, to map device memory into their address spaces, and to share memory with other processes. The shared address space may either be obtained by mapping a file into (possibly different) parts of their address space, or by arranging to share ‘‘anonymous memory’ ’ (that is, memory that is zero fill on demand, and whose contents are lost when the last process
Keyphrases
berkeley unix swap space file system new virtual memory implementation address space virtual memory multiple fetch large sparse address space physical memory last process new implementation share memory share anonymous memory new approach device memory new functionality swap area host machine maximum virtual memory shared address space local swap disk
