Virtual memory compression

Algorithms for compressing in-memory data

Virtual memory compression (also referred to as RAM compression and memory compression) is a memory management technique that utilizes data compression to reduce the size or number of paging requests to and from the auxiliary storage.[1] In a virtual memory compression system, pages to be paged out of virtual memory are compressed and stored in physical memory, which is usually random-access memory (RAM), or sent as compressed to auxiliary storage such as a hard disk drive (HDD) or solid-state drive (SSD). In both cases the virtual memory range, whose contents has been compressed, is marked inaccessible so that attempts to access compressed pages can trigger page faults and reversal of the process (retrieval from auxiliary storage and decompression). The footprint of the data being paged is reduced by the compression process; in the first instance, the freed RAM is returned to the available physical memory pool, while the compressed portion is kept in RAM. In the second instance, the compressed data is sent to auxiliary storage but the resulting I/O operation is smaller and therefore takes less time.[2][3]

In some implementations, including zswap, zram and Helix Software Company’s Hurricane, the entire process is implemented in software. In other systems, such as IBM's MXT, the compression process occurs in a dedicated processor that handles transfers between a local cache and RAM.

Virtual memory compression is distinct from garbage collection (GC) systems, which remove unused memory blocks and in some cases consolidate used memory regions, reducing fragmentation and improving efficiency. Virtual memory compression is also distinct from context switching systems, such as Connectix's RAM Doubler (though it also did online compression) and Apple OS 7.1, in which inactive processes are suspended and then compressed as a whole.[4]

## Types

[edit]

There are two general types of virtual memory compression : (1) sending compressed pages to a swap file in main memory, possibly with a backing store in auxiliary storage,[1][5][6] and (2) storing compressed pages side-by-side with uncompressed pages.[1]

The first type (1) usually uses some sort of LZ class dictionary compression algorithm combined with entropy coding, such as LZO or LZ4,[6][5] to compress the pages being swapped out. Once compressed, they are either stored in a swap file in main memory, or written to auxiliary storage, such as a hard disk.[6][5] A two stage process can be used instead wherein there exists both a backing store in auxiliary storage and a swap file in main memory and pages that are evicted from the in-memory swap file are written to the backing store with a much increased write bandwidth (eg. pages/sec) so that writing to the backing store takes less time. This last scheme leverages the benefits of both previous methods : fast in-memory data access with a large increase in the total amount of data that can be swapped out and an increased bandwidth in writing pages (pages/sec) to auxiliary storage.[6][5][1]

One example of a class of algorithms for type (2) virtual memory compression is the WK (Wilson-Kaplan et. al) class of compression algorithms. These take advantage of in-memory data regularities present in pointers and integers.[1][7] Specifically, in (the data segment -- the WK algorithms are not suitable for instruction compression[1]) target code generated by most high-level programming languages, both integers and pointers are often present in records whose elements are word-aligned. Furthermore, the values stored in integers are usually small. Also pointers close to each other in memory tend to point to locations that are themselves nearby in memory. Additionally, common data patterns such as a word of all zeroes can be encoded in the compressed output by a very small code (two bits in the case of WKdm). Using these data regularities, the WK class of algorithms use a very small dictionary ( 16 entries in the case of WKdm ) to achieve up to a 2:1 compression ratio while achieving much greater speeds and having less overhead than LZ class dictionary compression schemes.[1][7]

## Benefits

[edit]

By reducing the I/O activity caused by paging requests, virtual memory compression can produce overall performance improvements. The degree of performance improvement depends on a variety of factors, including the availability of any compression co-processors, spare bandwidth on the CPU, speed of the I/O channel, speed of the physical memory, and the compressibility of the physical memory contents.

On multi-core, multithreaded CPUs, some benchmarks show performance improvements of over 50%.[8][9]

In some situations, such as in embedded devices, auxiliary storage is limited or non-existent. In these cases, virtual memory compression can allow a virtual memory system to operate, where otherwise virtual memory would have to be disabled. This allows the system to run certain software which would otherwise be unable to operate in an environment with no virtual memory.[10]

## Shortcomings

[edit]

This section needs additional citations for verification. Please help improve this article by adding citations to reliable sources in this section. Unsourced material may be challenged and removed.
Find sources: "Virtual memory compression" – news · newspapers · books · scholar · JSTOR (January 2015) (Learn how and when to remove this message)

|

### Low compression ratios

[edit]

One of the primary issues is the degree to which the contents of physical memory can be compressed under real-world loads. Program code and much of the data held in physical memory is often not highly compressible, since efficient programming techniques and data architectures are designed to automatically eliminate redundancy in data sets. Various studies show typical data compression ratios ranging from 2:1 to 2.5:1 for program data,[7][11] similar to typically achievable compression ratios with disk compression.[10]

### Background I/O

[edit]

In order for virtual memory compression to provide measurable performance improvements, the throughput of the virtual memory system must be improved when compared to the uncompressed equivalent. Thus, the additional amount of processing introduced by the compression must not increase the overall latency. However, in I/O-bound systems or applications with highly compressible data sets, the gains can be substantial.[10]

### Increased thrashing

[edit]

The physical memory used by a compression system reduces the amount of physical memory available to processes that a system runs, which may result in increased paging activity and reduced overall effectiveness of virtual memory compression. This relationship between the paging activity and available physical memory is roughly exponential, meaning that reducing the amount of physical memory available to system processes results in an exponential increase of paging activity.[12][13]

In circumstances where the amount of free physical memory is low and paging is fairly prevalent, any performance gains provided by the compression system (compared to paging directly to and from auxiliary storage) may be offset by an increased page fault rate that leads to thrashing and degraded system performance. In an opposite state, where enough physical memory is available and paging activity is low, compression may not impact performance enough to be noticeable. The middle ground between these two circumstances‍—‌low RAM with high paging activity, and plenty of RAM with low paging activity‍—‌is where virtual memory compression may be most useful. However, the more compressible the program data is, the more pronounced are the performance improvements as less physical memory is needed to hold the compressed data.

For example, in order to maximize the use of a compressed pages cache, Helix Software Company's Hurricane 2.0 provides a user-configurable compression rejection threshold. By compressing the first 256 to 512 bytes of a 4 KiB page, this virtual memory compression system determines whether the configured compression level threshold can be achieved for a particular page; if achievable, the rest of the page would be compressed and retained in a compressed cache, and otherwise the page would be sent to auxiliary storage through the normal paging system. The default setting for this threshold is an 8:1 compression ratio.[14][4]

### CPU utilization overhead

[edit]

In hardware implementations, the technology also relies on price differentials between the various components of the system, for example, the difference between the cost of RAM and the cost of a processor dedicated to compression. The relative price-to-performance differences of the various components tend to vary over time. For example, the addition of a compression co-processor may have minimal impact on the cost of a CPU.

### Prioritization

[edit]

In a typical virtual memory implementation, paging happens on a least recently used basis, potentially causing the compression algorithm to use up CPU cycles dealing with the lowest priority data. Furthermore, program code is usually read-only, and is therefore never paged-out. Instead code is simply discarded, and re-loaded from the program’s auxiliary storage file if needed. In this case the bar for compression is higher, since the I/O cycle it is attempting to eliminate is much shorter, particularly on flash memory devices.

## History

[edit]

Virtual memory compression has gone in and out of favor as a technology. The price and speed of RAM and external storage have plummeted due to Moore's Law and improved RAM interfaces such as DDR3, thus reducing the need for virtual memory compression, while multi-core processors, server farms, and mobile technology together with the advent of flash based systems make virtual memory compression more attractive.

### Origins

[edit]

Acorn Computers' Unix variant, RISC iX, was supplied as the primary operating system for its R140 workstation released in 1989.[15] RISC iX provided support for demand paging of compressed executable files. However, the principal motivation for providing compressed executable files was to accommodate a complete Unix system in a hard disk of relatively modest size. Compressed data was not paged out to disk under this scheme.[16][17]

Paul R. Wilson proposed compressed caching of virtual memory pages in 1990, in a paper circulated at the ACM OOPSLA/ECOOP '90 Workshop on Garbage Collection ("Some Issues and Strategies in Heap Management and Memory Hierarchies"), and appearing in ACM SIGPLAN Notices in January 1991.[18]

Helix Software Company pioneered virtual memory compression in 1992, filing a patent application for the process in October of that year.[2] In 1994 and 1995, Helix refined the process using test-compression and secondary memory caches on video cards and other devices.[3] However, Helix did not release a product incorporating virtual memory compression until July 1996 and the release of Hurricane 2.0, which used the Stac Electronics Lempel–Ziv–Stac compression algorithm and also used off-screen video RAM as a compression buffer to gain performance benefits.[14]

In 1995, RAM cost nearly $50 per megabyte, and Microsoft's Windows 95 listed a minimum requirement of 4 MB of RAM.[19] Due to the high RAM requirement, several programs were released which claimed to use compression technology to gain “memory”. Most notorious was the SoftRAM program from Syncronys Softcorp. SoftRAM was exposed as fake because it did not perform any compression at all.[20][10] Other products, including Hurricane and MagnaRAM, included virtual memory compression, but implemented only run-length encoding, with poor results, giving the technology a negative reputation.[21]

In its 8 April 1997 issue, PC Magazine published a comprehensive test of the performance enhancement claims of several software virtual memory compression tools. In its testing PC Magazine found a minimal (5% overall) performance improvement from the use of Hurricane, and none at all from any of the other packages.[21] However the tests were run on Intel Pentium systems which had a single core and were single threaded, and thus compression directly impacted all system activity.

In 1996, IBM began experimenting with compression, and in 2000 IBM announced its Memory eXpansion Technology (MXT).[22][23] MXT was a stand-alone chip which acted as a CPU cache between the CPU and memory controller. MXT had an integrated compression engine which compressed all data heading to/from physical memory. Subsequent testing of the technology by Intel showed 5–20% overall system performance improvement, similar to the results obtained by PC Magazine with Hurricane.[24]

### Recent developments

[edit]

* In early 2008, a Linux project named zram (originally called compcache) was released; in a 2013 update, it was incorporated into ChromeOS[25] and Android 4.4
* In 2010, IBM released Active Memory Expansion (AME) for AIX 6.1 which implements virtual memory compression.[26]
* In 2012, some versions of the POWER7\+ chip included AME hardware accelerators using the 842 compression algorithm for data compression support, used on AIX, for virtual memory compression.[27] More recent POWER processors continue to support the feature.
* In December 2012, the zswap project was announced; it was merged into the Linux kernel mainline in September 2013.
* In June 2013, Apple announced that it would include virtual memory compression in OS X Mavericks, using the Wilson-Kaplan WKdm algorithm.[28][29]
* A 10 August 2015 "Windows Insider Preview" update for Windows 10 (build 10525) added support for RAM compression.[30]

## See also

[edit]

* Disk compression
* Swap partitions on SSDs

## References

[edit]

1. ^ a b c d e f g Wilson, Paul R.; Kaplan, Scott F.; Smaragdakis, Yannis (1999-06-06). The Case for Compressed Caching in Virtual Memory Systems (PDF). USENIX Annual Technical Conference. Monterey, California, USA. pp. 101–116.
2. ^ a b US 5559978, Spilo, Michael L., "Method for increasing the efficiency of a virtual memory system by selective compression of RAM memory contents", published 1996-09-24, assigned to Helix Software Co., Inc.
3. ^ a b US 5875474, Fabrizio, Daniel & Spilo, Michael L., "Method for caching virtual memory paging and disk input/output requests using off screen video memory", published 1999-02-23, assigned to Helix Software Co., Inc.
4. ^ a b "Mac Memory Booster Gets an Upgrade". Computerworld. 30 (37). IDG Enterprise: 56. 1996-09-09. ISSN 0010-4841. Retrieved 2015-01-12.
5. ^ a b c d "Gupta", "Nitin". ""zram: Compressed RAM-based block devices"". docs.kernel.org. "The kernel development community". Retrieved 2023-12-29.
6. ^ a b c d ""zswap"". www.kernel.org. "The kernel development community". Retrieved 2023-12-29.
7. ^ a b c Simpson, Matthew (2014). "Analysis of Compression Algorithms for Program Data" (PDF). pp. 4–14. Retrieved 2015-01-09.
8. ^ Jennings, Seth. "Transparent Memory Compression in Linux" (PDF). linuxfoundation.org. Archived from the original (PDF) on 2015-01-04. Retrieved 2015-01-01.
9. ^ "Performance numbers for compcache". Retrieved 2015-01-01.
10. ^ a b c d Paul, Matthias R. (1997-07-30) [1996-04-14]. "Kapitel II.18. Mit STACKER Hauptspeicher 'virtuell' verdoppeln…" [Utilizing STACKER to 'virtually' double main memory…]. NWDOS-TIPs — Tips & Tricks rund um Novell DOS 7, mit Blick auf undokumentierte Details, Bugs und Workarounds [NWDOS-TIPs — Tips & tricks for Novell DOS 7, with a focus on undocumented details, bugs and workarounds]. Release 157 (in German) (3 ed.). Archived from the original on 2016-11-05. Retrieved 2012-01-11.
11. ^ Rizzo, Luigi (1996). "A very fast algorithm for RAM compression". ACM SIGOPS Operating Systems Review. 31 (2): 8. doi:10.1145/250007.250012. S2CID 18563587. Retrieved 2015-01-09.
12. ^ Denning, Peter J. (1968). "Thrashing: Its causes and prevention" (PDF). Proceedings AFIPS, Fall Joint Computer Conference. 33: 918. Retrieved 2015-01-05.
13. ^ Freedman, Michael J. (2000-03-16). "The Compression Cache: Virtual Memory Compression for Handheld Computers" (PDF). Retrieved 2015-01-09.
14. ^ a b "Hurricane 2.0 Squeezes the Most Memory from Your System". PC Magazine. 1996-10-08. Retrieved 2015-01-01.
15. ^ Cox, James (December 1989). "Power to the People". Acorn User. pp. 66–67, 69, 71. Retrieved 2020-09-06.
16. ^ Taunton, Mark (1991). "Compressed Executables: An Exercise in Thinking Small". Proceedings of the Summer 1991 USENIX Conference, Nashville, TN, USA, June 1991. USENIX Association. pp. 385–404.
17. ^ Taunton, Mark (1991-01-22). "Compressed executables". Newsgroup: comp.unix.internals. Usenet: 4743@acorn.co.uk. Retrieved 2020-10-10.
18. ^ Wilson, Paul R. (1991). "Some Issues and Strategies in Heap Management and Memory Hierarchies". ACM SIGPLAN Notices. 26 (3): 45–52\. doi:10.1145/122167.122173. S2CID 15404854.
19. ^ "Windows 95 Installation Requirements". Microsoft. Retrieved 2015-01-01.
20. ^ "SoftRAM Under Scruitny". PC Magazine. 1996-01-23. Retrieved 2015-01-01.
21. ^ a b "Performance Enhancers". PC Magazine. 1997-04-08. Retrieved 2015-01-01.
22. ^ "IBM Research Breakthrough Doubles Computer Memory Capacity". IBM. 2000-06-26. Archived from the original on 2013-06-22. Retrieved 2015-01-01.
23. ^ "Memory eXpansion Technologies". IBM. Retrieved 2015-01-01.
24. ^ Kant, Krishna (2003-02-01). "An Evaluation of Memory Compression Alternatives". Intel Corporation. Retrieved 2015-01-01.
25. ^ "CompCache". Google code. Retrieved 2015-01-01.
26. ^ "AIX 6.1 Active Memory Expansion". IBM. Archived from the original on 2015-01-04. Retrieved 2015-01-01.
27. ^ "IBM Power Systems Hardware Deep Dive" (PDF). IBM. Archived from the original (PDF) on 2015-01-04. Retrieved 2015-01-01.
28. ^ "OS X 10.9 Mavericks: The Ars Technica Review". 2013-10-22.
29. ^ "The Case for Compressed Caching in Virtual Memory Systems".
30. ^ Aul, Gabe (2015-08-18). "Announcing Windows 10 Insider Preview Build 10525". Windows Insider Blog. Microsoft. Retrieved 2024-08-03.

* v
* t
* e

Memory management

* Memory management as a function of an operating system

Hardware|

* Memory management unit (MMU)
* Translation lookaside buffer (TLB)
* Input–output memory management unit (IOMMU)

Virtual memory|

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

Segmentation|

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

Allocator|

* dlmalloc
* Hoard
* jemalloc
* libumem
* mimalloc
* ptmalloc

Manual means|

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

Garbage
collection|

* Automatic Reference Counting
* Boehm garbage collector
* Cheney's algorithm
* Concurrent mark sweep collector
* Finalizer
* Garbage
* Garbage-first collector
* Mark–compact algorithm
* Reference counting
* Tracing garbage collection
* Strong reference
* Weak reference

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
* Memory pool

* Memory management
* Virtual memory
* Automatic memory management
* Memory management algorithms
* Memory management software

* v
* t
* e

Operating systems

General|

* Comparison
* Forensic engineering
* History
* List
* Timeline
* Usage share
* User features comparison

Variants|

* Disk operating system
* Distributed operating system
* Embedded operating system
* Hobbyist operating system
* Just enough operating system
* Mobile operating system
* Network operating system
* Object-oriented operating system
* Real-time operating system
* Supercomputer operating system

Kernel|

| Architectures|

* Exokernel
* Hybrid
* Microkernel
* Monolithic
* Multikernel
* vkernel
* Rump kernel
* Unikernel

|

Components|

* Device driver
* Loadable kernel module
* User space and kernel space

Process management|

| Concepts|

* Computer multitasking (Cooperative, Preemptive)
* Context switch
* Interrupt
* IPC
* Process
* Process control block
* Real-time
* Thread
* Time-sharing

|

Scheduling
algorithms|

* Fixed-priority preemptive
* Multilevel feedback queue
* Round-robin
* Shortest job next

Memory management,
resource protection|

* Bus error
* General protection fault
* Memory paging
* Memory protection
* Protection ring
* Segmentation fault
* Virtual memory

Storage access,
file systems|

* Boot loader
* Defragmentation
* Device file
* File attribute
* Inode
* Journal
* Partition
* Virtual file system
* Virtual tape library

Supporting concepts|

* API
* Computer network
* HAL
* Live CD
* Live USB
* Shell
* CLI
* User interface
* PXE

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template