Optimizing LZSS Compression on GPGPUs
School of Informatics and Computing, Indiana University, Bloomington, IN 47405, USA
Indiana University, 2013
@article{ozsoy2013optimizing,
title={Optimizing LZSS Compression on GPGPUs},
author={Ozsoy, Adnan and Swany, Martin and Chauhan, Arun},
year={2013}
}
In this paper, we present an algorithm and provide design improvements needed to port the serial Lempel-Ziv-Storer-Szymanski (LZSS), lossless data compression algorithm, to a parallelized version suitable for general purpose graphic processor units (GPGPU), specifically for NVIDIA’s CUDA Framework. The two main stages of the algorithm, substring matching and encoding, are studied in detail to fit into the GPU architecture. We conducted detailed analysis of our performance results and compared them to serial and parallel CPU implementations of LZSS algorithm. We also benchmarked our algorithm in comparison with well known, widely used programs; GZIP and ZLIB. We achieved up to 34x better throughput than the serial CPU implementation of LZSS algorithm and up to 2.21x better than the parallelized version.
December 29, 2013 by hgpu
