- Source: 842 (compression algorithm)
842, 8-4-2, or EFT is a data compression algorithm. It is a variation on Lempel–Ziv compression with a limited dictionary length. With typical data, 842 gives 80 to 90 percent of the compression of LZ77 with much faster throughput and less memory use. Hardware implementations also provide minimal use of energy and minimal chip area.
842 compression can be used for virtual memory compression, for databases — especially column-oriented stores, and when streaming input-output — for example to do backups or to write to log files.
Algorithm
The algorithm operates on blocks of 8 bytes with sub-phrases of 8, 4 and 2 bytes. A hash of each phrase is used to look up a hash table with offsets to a sliding window buffer of past encoded data. Matches can be replaced by the offset, so the result for each block can be some mixture of matched data and new literal data.
Implementations
IBM added hardware accelerators and instructions for 842 compression to their Power processors from POWER7+ onward. In addition, POWER9 and Power10 added hardware acceleration for the RFC 1951 Deflate algorithm, which is used by zlib and gzip.
A device driver for hardware-assisted 842 compression on a POWER processor was added to the Linux kernel in 2011. More recently, Linux can fallback to a software implementation, which of course is much slower. zram, a Linux kernel module for compressed RAM drives, can be configured to use 842.
Researchers have implemented 842 using graphics processing units and found about 30x faster decompression using dedicated GPUs. An open source library provides 842 for CUDA and OpenCL. An FPGA implementation of 842 demonstrated 13 times better throughput than a software implementation.
References
Kata Kunci Pencarian:
- 842 (compression algorithm)
- Virtual memory compression
- Discrete cosine transform
- Silence compression
- Zram
- Approximate counting algorithm
- Post-quantum cryptography
- Audio codec
- Large language model
- Quality of experience
