Previous: The runtimes of the
All of our compression algorithms achieve roughly a factor of two in
compression on average for all six programs. All can compress and
decompress a page in well under half a millisecond on all processors.
The WKdm algorithm is the fastest, compressing a page in about 0.25
milliseconds and decompressing in about 0.15 milliseconds on the
Pentium Pro, faster on the SPARC 168 MHz, and over twice as fast on the
SPARC 300 MHz. (This is over 20 MB compressed and uncompressed per
second, about the bandwidth of a quite fast disk.) LZO is about 20%
slower, and LZRW1 about 20% slower still.
Scott F. Kaplan