| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6873667 | Future Generation Computer Systems | 2014 | 30 Pages |
Abstract
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 34Ã better throughput than the serial CPU implementation of LZSS algorithm and up to 2.21Ã better than the parallelized version.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Adnan Ozsoy, Martin Swany, Arun Chauhan,