This article may rely excessively on sources too closely associated with the subject, potentially preventing the article from being verifiable and neutral. (March 2015) (Learn how and when to remove this template message)
This article needs additional citations for verification. (July 2014) (Learn how and when to remove this template message)
|Developer(s)||Markus F.X.J. Oberhumer|
|Initial release||May 20, 1996|
2.10 / March 1, 2017
|License||GPLv2 or commercial|
The original "lzop" implementation, released in 1996, was developed by Markus Franz Xaver Johannes Oberhumer, based on earlier algorithms by Abraham Lempel and Jacob Ziv. The LZO library implements a number of algorithms with the following characteristics:
- higher compression speed compared to DEFLATE compression
- very fast decompression
- requires an additional buffer during compression (of size 8 kB or 64 kB, depending on compression level)
- requires no additional memory for decompression other than the source and destination buffers
- allows the user to adjust the balance between compression ratio and compression speed, without affecting the speed of decompression
LZO supports overlapping compression and in-place decompression. As a block compression algorithm, it compresses and decompresses blocks of data. Block size must be the same for compression and decompression. LZO compresses a block of data into matches (a sliding dictionary) and runs of non-matching literals to produce good results on highly redundant data and deals acceptably with non-compressible data, only expanding incompressible data by a maximum of 1/64 of the original size when measured over a block size of at least 1 kB.
The reference implementation is written in ANSI C, and it has been made available as free software under the GNU General Public License. The copyright for the code is owned by Markus F. X. J. Oberhumer. It was originally published in 1996. Oberhumer has also written a command-line frontend called lzop.
Versions of LZO are available for the Perl, Python and Java languages. Various LZO implementations are reported to work under Win32, AIX, ConvexOS, IRIX, Mac OS, Palm OS, PlayStation, Nintendo 64, Wii, Solaris, SunOS, TOS (Atari ST), Linux and VxWorks.
The Linux kernel uses its LZO implementation in some of its features:
- btrfs uses LZO as a possible compression method for file system compression.
- initrd and initramfs use LZO as a possible compression method for initial RAM drive compression.
- SquashFS uses LZO as a possible compression method for file system compression.
- zram uses LZO with run-length encoding called
LZO-RLEas the default compression method for RAM drive compression.
- zswap uses LZO as the default compression method for virtual memory compression
- oberhumer.com: LZO real-time data compression library
- LZO/LZOP Fanpage at the Wayback Machine (archived June 25, 2012)
- Arnaud Bouche (2008). "LZO fast compress/uncompress: implementation in 80386 machine code for Delphi".
- lzo-java on GitHub - Pure Java implementation of the liblzo2 LZO compression algorithm
- LZO stream format as understood by Linux's LZO decompressor