Virtual memory

Short description: Computer memory management technique

This article is about the computer memory management technique. For the technique of pooling multiple storage devices, see Storage virtualization. For the TBN game show, see Virtual Memory (game show).

Virtual memory combines active RAM and inactive memory on DASD[lower-alpha 1] to form a large range of contiguous addresses.

In computing, virtual memory, or virtual storage,[lower-alpha 2] is a memory management technique that provides an "idealized abstraction of the storage resources that are actually available on a given machine"[3] which "creates the illusion to users of a very large (main) memory".[4]

The computer's operating system, using a combination of hardware and software, maps memory addresses used by a program, called virtual addresses, into physical addresses in computer memory. Main storage, as seen by a process or task, appears as a contiguous address space or collection of contiguous segments. The operating system manages virtual address spaces and the assignment of real memory to virtual memory.[5] Address translation hardware in the CPU, often referred to as a memory management unit (MMU), automatically translates virtual addresses to physical addresses. Software within the operating system may extend these capabilities, utilizing, e.g., disk storage, to provide a virtual address space that can exceed the capacity of real memory and thus reference more memory than is physically present in the computer.

The primary benefits of virtual memory include freeing applications from having to manage a shared memory space, ability to share memory used by libraries between processes, increased security due to memory isolation, and being able to conceptually use more memory than might be physically available, using the technique of paging or segmentation.

## Contents

* 1 Properties
* 2 Usage
* 3 History
* 4 Paged virtual memory
* 4.1 Page tables
* 4.2 Paging supervisor
* 4.3 Pinned pages
* 4.3.1 Virtual-real operation
* 4.4 Thrashing
* 5 Segmented virtual memory
* 6 Address space swapping
* 7 See also
* 8 Notes
* 9 References
* 10 Further reading
* 11 External links

## Properties

Virtual memory makes application programming easier by hiding fragmentation of physical memory; by delegating to the kernel the burden of managing the memory hierarchy (eliminating the need for the program to handle overlays explicitly); and, when each process is run in its own dedicated address space, by obviating the need to relocate program code or to access memory with relative addressing.

Memory virtualization can be considered a generalization of the concept of virtual memory.

## Usage

Virtual memory is an integral part of a modern computer architecture; implementations usually require hardware support, typically in the form of a memory management unit built into the CPU. While not necessary, emulators and virtual machines can employ hardware support to increase performance of their virtual memory implementations.[6] Older operating systems, such as those for the mainframes of the 1960s, and those for personal computers of the early to mid-1980s (e.g., DOS),[7] generally have no virtual memory functionality,[dubious - discuss] though notable exceptions for mainframes of the 1960s include:

* the Atlas Supervisor for the Atlas
* THE multiprogramming system for the Electrologica X8 (software based virtual memory without hardware support)
* MCP for the Burroughs B5000
* MTS, TSS/360 and CP/CMS for the IBM System/360 Model 67
* Multics for the GE 645
* The Time Sharing Operating System for the RCA Spectra 70/46

During the 1960s and early '70s, computer memory was very expensive. The introduction of virtual memory provided an ability for software systems with large memory demands to run on computers with less real memory. The savings from this provided a strong incentive to switch to virtual memory for all systems. The additional capability of providing virtual address spaces added another level of security and reliability, thus making virtual memory even more attractive to the marketplace.

Most modern operating systems that support virtual memory also run each process in its own dedicated address space. Each program thus appears to have sole access to the virtual memory. However, some older operating systems (such as OS/VS1 and OS/VS2 SVS) and even modern ones (such as IBM i) are single address space operating systems that run all processes in a single address space composed of virtualized memory.

Embedded systems and other special-purpose computer systems that require very fast and/or very consistent response times may opt not to use virtual memory due to decreased determinism; virtual memory systems trigger unpredictable traps that may produce unwanted and unpredictable delays in response to input, especially if the trap requires that data be read into main memory from secondary memory. The hardware to translate virtual addresses to physical addresses typically requires a significant chip area to implement, and not all chips used in embedded systems include that hardware, which is another reason some of those systems do not use virtual memory.

## History

In the 1950s, all larger programs had to contain logic for managing primary and secondary storage, such as overlaying. Virtual memory was therefore introduced not only to extend primary memory, but to make such an extension as easy as possible for programmers to use.[8] To allow for multiprogramming and multitasking, many early systems divided memory between multiple programs without virtual memory, such as early models of the PDP-10 via registers.

A claim that the concept of virtual memory was first developed by German physicist Fritz-Rudolf Güntsch at the Technische Universität Berlin in 1956 in his doctoral thesis, Logical Design of a Digital Computer with Multiple Asynchronous Rotating Drums and Automatic High Speed Memory Operation[9][10] does not stand up to careful scrutiny. The computer proposed by Güntsch (but never built) had an address space of 105 words which mapped exactly onto the 105 words of the drums, i.e. the addresses were real addresses and there was no form of indirect mapping, a key feature of virtual memory. What Güntsch did invent was a form of cache memory, since his high-speed memory was intended to contain a copy of some blocks of code or data taken from the drums. Indeed, he wrote (as quoted in translation[11]): "The programmer need not respect the existence of the primary memory (he need not even know that it exists), for there is only one sort of addresses (sic) by which one can program as if there were only one storage." This is exactly the situation in computers with cache memory, one of the earliest commercial examples of which was the IBM System/360 Model 85.[12] In the Model 85 all addresses were real addresses referring to the main core store. A semiconductor cache store, invisible to the user, held the contents of parts of the main store in use by the currently executing program. This is exactly analogous to Güntsch's system, designed as a means to improve performance, rather than to solve the problems involved in multi-programming.

The University of Manchester Atlas Computer was the first computer to feature true virtual memory.

The first true virtual memory system was that implemented at the University of Manchester to create a one-level storage system[13] as part of the Atlas Computer. It used a paging mechanism to map the virtual addresses available to the programmer onto the real memory that consisted of 16,384 words of primary core memory with an additional 98,304 words of secondary drum memory.[14] The addition of virtual memory into the Atlas also eliminated a looming programming problem: planning and scheduling data transfers between main and secondary memory and recompiling programs for each change of size of main memory.[15] The first Atlas was commissioned in 1962 but working prototypes of paging had been developed by 1959.[8]: 2 [16][17] In 1961, the Burroughs Corporation independently released the first commercial computer with virtual memory, the B5000, with segmentation rather than paging.[18][19]

IBM developed[lower-alpha 3] the concept of hypervisors in their CP-40 and CP-67, and in 1972 provided it for the S/370 as Virtual Machine Facility/370.[21] IBM introduced the Start Interpretive Execution (SIE) instruction as part of 370-XA on the 3081, and VM/XA versions of VM to exploit it.

Before virtual memory could be implemented in mainstream operating systems, many problems had to be addressed. Dynamic address translation required expensive and difficult-to-build specialized hardware; initial implementations slowed down access to memory slightly.[8] There were worries that new system-wide algorithms utilizing secondary storage would be less effective than previously used application-specific algorithms. By 1969, the debate over virtual memory for commercial computers was over;[8] an IBM research team led by David Sayre showed that their virtual memory overlay system consistently worked better than the best manually controlled systems.[22] Throughout the 1970s, the IBM 370 series running their virtual-storage based operating systems provided a means for business users to migrate multiple older systems into fewer, more powerful, mainframes that had improved price/performance. The first minicomputer to introduce virtual memory was the Norwegian NORD-1; during the 1970s, other minicomputers implemented virtual memory, notably VAX models running VMS.

Virtual memory was introduced to the x86 architecture with the protected mode of the Intel 80286 processor, but its segment swapping technique scaled poorly to larger segment sizes. The Intel 80386 introduced paging support underneath the existing segmentation layer, enabling the page fault exception to chain with other exceptions without double fault. However, loading segment descriptors was an expensive operation, causing operating system designers to rely strictly on paging rather than a combination of paging and segmentation.[citation needed]

## Paged virtual memory

Nearly all current implementations of virtual memory divide a virtual address space into pages, blocks of contiguous virtual memory addresses. Pages on contemporary[lower-alpha 4] systems are usually at least 4 kilobytes in size; systems with large virtual address ranges or amounts of real memory generally use larger page sizes.[23]

### Page tables

Page tables are used to translate the virtual addresses seen by the application into physical addresses used by the hardware to process instructions;[24] such hardware that handles this specific translation is often known as the memory management unit. Each entry in the page table holds a flag indicating whether the corresponding page is in real memory or not. If it is in real memory, the page table entry will contain the real memory address at which the page is stored. When a reference is made to a page by the hardware, if the page table entry for the page indicates that it is not currently in real memory, the hardware raises a page fault exception, invoking the paging supervisor component of the operating system.

Systems can have, e.g., one page table for the whole system, separate page tables for each address space or process, separate page tables for each segment; similarly, systems can have, e.g., no segment table, one segment table for the whole system, separate segment tables for each address space or process, separate segment tables for each region in a tree[lower-alpha 5] of region tables for each address space or process. If there is only one page table, different applications running at the same time use different parts of a single range of virtual addresses. If there are multiple page or segment tables, there are multiple virtual address spaces and concurrent applications with separate page tables redirect to different real addresses.

Some earlier systems with smaller real memory sizes, such as the SDS 940, used page registers instead of page tables in memory for address translation.

### Paging supervisor

This part of the operating system creates and manages page tables and lists of free page frames. In order to ensure that there will be enough free page frames to quickly resolve page faults, the system may periodically steal allocated page frames, using a page replacement algorithm, e.g., a Least recently used (LRU) algorithm. Stolen page frames that have been modified are written back to auxiliary storage before they are added to the free queue. On some systems the paging supervisor is also responsible for managing translation registers that are not automatically loaded from page tables.

Typically, a page fault that cannot be resolved results in an abnormal termination of the application. However, some systems allow the application to have exception handlers for such errors. The paging supervisor may handle a page fault exception in several different ways, depending on the details:

* If the virtual address is invalid, the paging supervisor treats it as an error.
* If the page is valid and the page information is not loaded into the MMU, the page information will be stored into one of the page registers.
* If the page is uninitialized, a new page frame may be assigned and cleared.
* If there is a stolen page frame containing the desired page, that page frame will be reused.
* For a fault due to a write attempt into a read-protected page, if it is a copy-on-write page then a free page frame will be assigned and the contents of the old page copied; otherwise it is treated as an error.
* If the virtual address is a valid page in a memory-mapped file or a paging file, a free page frame will be assigned and the page read in.

In most cases, there will be an update to the page table, possibly followed by purging the Translation Lookaside Buffer (TLB), and the system restarts the instruction that causes the exception.

If the free page frame queue is empty then the paging supervisor must free a page frame using the same page replacement algorithm for page stealing.

### Pinned pages

Operating systems have memory areas that are pinned (never swapped to secondary storage). Other terms used are locked, fixed, or wired pages. For example, interrupt mechanisms rely on an array of pointers to their handlers, such as I/O completion and page fault. If the pages containing these pointers or the code that they invoke were pageable, interrupt-handling would become far more complex and time-consuming, particularly in the case of page fault interruptions. Hence, some part of the page table structures is not pageable.

Some pages may be pinned for short periods of time, others may be pinned for long periods of time, and still others may need to be permanently pinned. For example:

* The paging supervisor code and drivers for secondary storage devices on which pages reside must be permanently pinned, as otherwise paging would not even work because the necessary code would not be available.
* Timing-dependent components may be pinned to avoid variable paging delays.
* Data buffers that are accessed directly by peripheral devices that use direct memory access or I/O channels must reside in pinned pages while the I/O operation is in progress because such devices and the buses to which they are attached expect to find data buffers located at physical memory addresses; regardless of whether the bus has a memory management unit for I/O, transfers cannot be stopped if a page fault occurs and then restarted when the page fault has been processed. For example, the data could come from a measurement sensor unit and lost real time data that got lost because of a page fault can not be recovered.

In IBM's operating systems for System/370 and successor systems, the term is "fixed", and such pages may be long-term fixed, or may be short-term fixed, or may be unfixed (i.e., pageable). System control structures are often long-term fixed (measured in wall-clock time, i.e., time measured in seconds, rather than time measured in fractions of one second) whereas I/O buffers are usually short-term fixed (usually measured in significantly less than wall-clock time, possibly for tens of milliseconds). Indeed, the OS has a special facility for "fast fixing" these short-term fixed data buffers (fixing which is performed without resorting to a time-consuming Supervisor Call instruction).

Multics used the term "wired". OpenVMS and Windows refer to pages temporarily made nonpageable (as for I/O buffers) as "locked", and simply "nonpageable" for those that are never pageable. The Single UNIX Specification also uses the term "locked" in the specification for `mlock()`, as do the `mlock()` man pages on many Unix-like systems.

#### Virtual-real operation

In OS/VS1 and similar OSes, some parts of systems memory are managed in "virtual-real" mode, called "V=R". In this mode every virtual address corresponds to the same real address. This mode is used for interrupt mechanisms, for the paging supervisor and page tables in older systems, and for application programs using non-standard I/O management. For example, IBM's z/OS has 3 modes (virtual-virtual, virtual-real and virtual-fixed).[citation needed]

### Thrashing

When paging and page stealing are used, a problem called "thrashing" can occur, in which the computer spends an unsuitably large amount of time transferring pages to and from a backing store, hence slowing down useful work. A task's working set is the minimum set of pages that should be in memory in order for it to make useful progress. Thrashing occurs when there is insufficient memory available to store the working sets of all active programs. Adding real memory is the simplest response, but improving application design, scheduling, and memory usage can help. Another solution is to reduce the number of active tasks on the system. This reduces demand on real memory by swapping out the entire working set of one or more processes.

A system thrashing is often a result of a sudden spike in page demand from a small number of running programs. Swap-token[26] is a lightweight and dynamic thrashing protection mechanism. The basic idea is to set a token in the system, which is randomly given to a process that has page faults when thrashing happens. The process that has the token is given a privilege to allocate more physical memory pages to build its working set, which is expected to quickly finish its execution and to release the memory pages to other processes. A time stamp is used to handover the token one by one. The first version of swap-token was implemented in Linux 2.6.[27] The second version is called preempt swap-token and is also in Linux 2.6.[27] In this updated swap-token implementation, a priority counter is set for each process to track the number of swap-out pages. The token is always given to the process with a high priority, which has a high number of swap-out pages. The length of the time stamp is not a constant but is determined by the priority: the higher the number of swap-out pages of a process, the longer the time stamp for it will be.

## Segmented virtual memory

Some systems, such as the Burroughs B5500,[28] use segmentation instead of paging, dividing virtual address spaces into variable-length segments. A virtual address here consists of a segment number and an offset within the segment. The Intel 80286 supports a similar segmentation scheme as an option, but it is rarely used. Segmentation and paging can be used together by dividing each segment into pages; systems with this memory structure, such as Multics and IBM System/38, are usually paging-predominant, segmentation providing memory protection.[29][30][31]

In the Intel 80386 and later IA-32 processors, the segments reside in a 32-bit linear, paged address space. Segments can be moved in and out of that space; pages there can "page" in and out of main memory, providing two levels of virtual memory; few if any operating systems do so, instead using only paging. Early non-hardware-assisted x86 virtualization solutions combined paging and segmentation because x86 paging offers only two protection domains whereas a VMM, guest OS or guest application stack needs three.[32]: 22 The difference between paging and segmentation systems is not only about memory division; segmentation is visible to user processes, as part of memory model semantics. Hence, instead of memory that looks like a single large space, it is structured into multiple spaces.

This difference has important consequences; a segment is not a page with variable length or a simple way to lengthen the address space. Segmentation that can provide a single-level memory model in which there is no differentiation between process memory and file system consists of only a list of segments (files) mapped into the process's potential address space.[33]

This is not the same as the mechanisms provided by calls such as mmap and Win32's MapViewOfFile, because inter-file pointers do not work when mapping files into semi-arbitrary places. In Multics, a file (or a segment from a multi-segment file) is mapped into a segment in the address space, so files are always mapped at a segment boundary. A file's linkage section can contain pointers for which an attempt to load the pointer into a register or make an indirect reference through it causes a trap. The unresolved pointer contains an indication of the name of the segment to which the pointer refers and an offset within the segment; the handler for the trap maps the segment into the address space, puts the segment number into the pointer, changes the tag field in the pointer so that it no longer causes a trap, and returns to the code where the trap occurred, re-executing the instruction that caused the trap.[34] This eliminates the need for a linker completely[8] and works when different processes map the same file into different places in their private address spaces.[35]

## Address space swapping

Some operating systems provide for swapping entire address spaces, in addition to whatever facilities they have for paging and segmentation. When this occurs, the OS writes those pages and segments currently in real memory to swap files. In a swap-in, the OS reads back the data from the swap files but does not automatically read back pages that had been paged out at the time of the swap out operation.

IBM's MVS, from OS/VS2 Release 2 through z/OS, provides for marking an address space as unswappable; doing so does not pin any pages in the address space. This can be done for the duration of a job by entering the name of an eligible[36] main program in the Program Properties Table with an unswappable flag. In addition, privileged code can temporarily make an address space unswappable using a SYSEVENT Supervisor Call instruction (SVC); certain changes[37] in the address space properties require that the OS swap it out and then swap it back in, using SYSEVENT TRANSWAP.[38]

Swapping does not necessarily require memory management hardware, if, for example, multiple jobs are swapped in and out of the same area of storage.

## See also

* Processor design
* Page (computer memory)
* Cache replacement policies
* Memory management
* Memory management (operating systems)
* Protected mode, an x86 mode that allows for virtual memory.
* CUDA Pinned memory
* Heterogeneous System Architecture, a series of specifications intended to unify CPU and GPU memory

## Notes

1. ↑ Early systems used drums; contemporary systems use disks or solid state memory
2. ↑ IBM uses the term virtual storage on mainframe operating systems. This usage runs from TSS[1] on the 360/67 through z/OS[2] on z/Architecture.
3. ↑ IBM had previously used the term hypervisor for the 360/65,[20] but that did not involve virtual memory
4. ↑ IBM DOS/VS, OS/VS1 and DOS/VS only supported 2 KB pages.
5. ↑ On IBM Z[25] there is a 3-level tree of regions for each address space.

## References

1. ↑ System/360 Model 67 Time Sharing System Preliminary Technical Summary. IBM. 1966. p. 21. C20-1647-0. http://bitsavers.org/pdf/ibm/360/tss/C20-1647-0_360-67_TSS_Tech.pdf.
2. ↑ z/OS Version 2 Release 4 z/OS Introduction and Release Guide. IBM. 22 September 2020. p. 3. GA32-0887-40. https://www-01.ibm.com/servers/resourcelink/svc00100.nsf/pages/zOSV2R4ga320887/$file/e0za100_v2r4.pdf.
3. ↑ Bhattacharjee, Abhishek; Lustig, Daniel (2017). Architectural and Operating System Support for Virtual Memory. Morgan & Claypool Publishers. p. 1. ISBN 9781627056021. https://books.google.com/books?id=roM4DwAAQBAJ. Retrieved 16 October 2017.
4. ↑ Haldar, Sibsankar; Aravind, Alex Alagarsamy (2010). Operating Systems. Pearson Education India. p. 269. ISBN 978-8131730225. https://books.google.com/books?id=orZ0CLxEMXEC&pg=PA269. Retrieved 16 October 2017.
5. ↑ Zhou, Xiangrong; Petrov, Peter (1 December 2008). "Direct address translation for virtual memory in energy-efficient embedded systems" (in en). ACM Transactions on Embedded Computing Systems 8 (1): 1–31. doi:10.1145/1457246.1457251. ISSN 1539-9087. https://dl.acm.org/doi/10.1145/1457246.1457251.
6. ↑ "AMD-V™ Nested Paging". AMD. http://developer.amd.com/wordpress/media/2012/10/NPT-WP-1 1-final-TM.pdf.
7. ↑ "Windows Version History". Microsoft. 23 September 2011. http://support.microsoft.com/kb/32905.
8. ↑ 8.0 8.1 8.2 8.3 8.4 "Before Memory Was Virtual". In the Beginning: Recollections of Software Pioneers. 1997. http://denninginstitute.com/pjd/PUBS/bvm.pdf.
9. ↑ Jessen, Elke (2004). "Origin of the Virtual Memory Concept". IEEE Annals of the History of Computing 26 (4): 71–72.
10. ↑ Jessen, E. (1996). "Die Entwicklung des virtuellen Speichers" (in de). Informatik-Spektrum 19 (4): 216–219. doi:10.1007/s002870050034. ISSN 0170-6012.
11. ↑ Jessen (2004).
12. ↑ Liptay, J.S. (1968), "Structural Aspects of the System/360 Model 85 – The Cache", IBM Systems Journal 7: 15–21, doi:10.1147/sj.71.0015
13. ↑ Kilburn, T.; Edwards, D.B.G.; Lanigan, M.J.; Sumner, F.H. (1962), "One-level Storage System", IRE Trans EC-11 (2): 223–235, doi:10.1109/TEC.1962.5219356
14. ↑ "Ferranti Atlas 1 & 2 – Systems Architecture". 12 November 2009. https://www.ourcomputerheritage.org/Maincomp/Fer/ccs-f5x2.pdf.
15. ↑ Denning, Peter J. (1 January 2003). Encyclopedia of Computer Science. John Wiley and Sons. pp. 1832–1835. ISBN 978-0-470-86412-8.
16. ↑ Creasy, R. J. (September 1981). "The origin of the VM/370 time-sharing system". IBM Journal of Research & Development 25 (5): 486. doi:10.1147/rd.255.0483. http://pages.cs.wisc.edu/~stjones/proj/vm_reading/ibmrd2505M.pdf.
17. ↑ "The Atlas". http://www.computer50.org/kgill/atlas/atlas.html.
18. ↑ Joyner, Ian. "Burroughs". http://ianjoyner.name/Burroughs.html.
19. ↑ Cragon, Harvey G. (1996). Memory Systems and Pipelined Processors. Jones and Bartlett Publishers. p. 113. ISBN 978-0-86720-474-2. https://books.google.com/books?id=q2w3JSFD7l4C.
20. ↑ Gary R. Allred (May 1971). "System/370 integrated emulation under OS and DOS". 1971 Spring Joint Computer Conference. 38. AFIPS Press. p. 164. doi:10.1109/AFIPS.1971.58. https://www.computer.org/csdl/proceedings/afips/1971/5077/00/50770163.pdf. Retrieved 12 June 2022.
21. ↑ z/VM built on IBM Virtualization Technology General Information Version 4 Release 3.0. 12 April 2002. GC24-5991-04. http://www.vm.ibm.com/pubs/HCSF8A50.PDF.
22. ↑ Sayre, D. (1969). "Is automatic "folding" of programs efficient enough to displace manual?". Communications of the ACM 12 (12): 656–660. doi:10.1145/363626.363629.
23. ↑ Quintero, Dino (1 May 2013). IBM Power Systems Performance Guide: Implementing and Optimizing. IBM Corporation. p. 138. ISBN 978-0738437668. https://books.google.com/books?id=lHTJAgAAQBAJ&pg=PA138. Retrieved 18 July 2017.
24. ↑ Sharma, Dp (2009). Foundation of Operating Systems. Excel Books India. p. 62. ISBN 978-81-7446-626-6. https://books.google.com/books?id=AjWh-o7eICMC&pg=PA62. Retrieved 18 July 2017.
25. ↑ z/Architecture - Principles of Operation (Fourteenth ed.). IBM. May 2022. pp. 3-46-3-53. SA22-7832-13. http://publibfp.dhe.ibm.com/epubs/pdf/a227832d.pdf. Retrieved January 18, 2023.
26. ↑ Song Jiang; Xiaodong Zhang (2005). "Token-ordered LRU: an effective page replacement policy and its implementation in Linux systems". Performance Evaluation 60 (1–4): 5–29. doi:10.1016/j.peva.2004.10.002. ISSN 0166-5316.
27. ↑ 27.0 27.1 "Swap Token effectively minimizes system thrasing effects and is adopted in OS kernels". https://web.cse.ohio-state.edu/~zhang.574/swaptoken-PE-05.html.
28. ↑ Burroughs (1964). Burroughs B5500 Information Processing System Reference Manual. Burroughs Corporation. 1021326. http://bitsavers.org/pdf/burroughs/B5000_5500_5700/1021326_B5500_RefMan_May67.pdf. Retrieved 28 November 2013.
29. ↑ GE-645 System Manual. January 1968. pp. 21–30. http://www.bitsavers.org/pdf/ge/GE-645/LSB0468_GE-645_System_Manual_Jan1968.pdf. Retrieved 25 February 2022.
30. ↑ Corbató, F.J.; Vyssotsky, V. A.. "Introduction and Overview of the Multics System". http://www.multicians.org/fjcc1.html.
31. ↑ "System Design of a Computer for Time Sharing Applications". http://www.multicians.org/fjcc2.html.
32. ↑ Smith, J. E.; Uhlig, R. (14 August 2005). "Virtual Machines: Architectures, Implementations and Applications, HOTCHIPS 17, Tutorial 1, part 2". https://old.hotchips.org/wp-content/uploads/hc_archives/hc17/1_Sun/HC17.T1P2.pdf.
33. ↑ Bensoussan, André; Clingen, CharlesT.; Daley, Robert C. (May 1972). "The Multics Virtual Memory: Concepts and Design". Communications of the ACM 15 (5): 308–318. doi:10.1145/355602.361306. http://www.multicians.org/multics-vm.html.
34. ↑ "Multics Execution Environment". http://www.multicians.org/exec-env.html.
35. ↑ Organick, Elliott I. (1972). The Multics System: An Examination of Its Structure. MIT Press. ISBN 978-0-262-15012-5. https://archive.org/details/multicssystemex00orga.
36. ↑ The most important requirement is that the program be APF authorized.
37. ↑ e.g., requesting use of preferred memory
38. ↑ "Control swapping (DONTSWAP, OKSWAP, TRANSWAP)". 1990–2014. http://pic.dhe.ibm.com/infocenter/zos/v2r1/index.jsp?topic=/com.ibm.zos.v2r1.ieaa400/swap.htm.

## Further reading

* Hennessy, John L.; and Patterson, David A.; Computer Architecture, A Quantitative Approach (ISBN 1-55860-724-2)

## External links

* Operating Systems: Three Easy Pieces, by Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau. Arpaci-Dusseau Books, 2014. Relevant chapters: Address Spaces Address Translation Segmentation Introduction to Paging TLBs Advanced Page Tables Swapping: Mechanisms Swapping: Policies
* "Time-Sharing Supervisor Programs". http://archive.michigan-terminal-system.org/documentation/documents/timeSharingSupervisorPrograms-1971.pdf. by Michael T. Alexander in Advanced Topics in Systems Programming, University of Michigan Engineering Summer Conference 1970 (revised May 1971), compares the scheduling and resource allocation approaches, including virtual memory and paging, used in four mainframe operating systems: CP-67, TSS/360, MTS, and Multics.
* LinuxMM: Linux Memory Management.
* Birth of Linux Kernel, mailing list discussion.

* v
* t
* e

Memory management

* Memory management as a function of an operating system

Manual memory management|

* Static memory allocation
* C dynamic memory allocation
* new and delete (C++)

Virtual memory|

* Demand paging
* Page table
* Paging
* Virtual memory compression

Hardware|

* Memory management unit
* Translation lookaside buffer

Garbage collection|

* Boehm garbage collector
* Concurrent mark sweep collector
* Finalizer
* Garbage
* Garbage-first collector
* Mark-compact algorithm
* Reference counting
* Tracing garbage collection
* Strong reference
* Weak reference

Memory segmentation|

* Protected mode
* Real mode
* Virtual 8086 mode
* x86 memory segmentation

Memory safety|

* Buffer overflow
* Buffer over-read
* Dangling pointer
* Stack overflow

Issues|

* Fragmentation
* Memory leak
* Unreachable memory

Other|

* Automatic variable
* International Symposium on Memory Management
* Region-based memory management

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Virtual memory. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Virtual_memory&oldid=248203"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template