Massively Parallel LZ77 Compression and Decompression on the GPU

dc.contributor.advisorBurtscher, Martin
dc.contributor.authorWesley, Kayla
dc.contributor.committeeMemberMetsis, Vangelis
dc.contributor.committeeMemberPeng, Wuxu
dc.date.accessioned2022-08-31T15:01:14Z
dc.date.available2022-08-31T15:01:14Z
dc.date.issued2022-08
dc.description.abstractParallelizing data compression algorithms is difficult because algorithms like LZ77 have iterative dependencies that cannot easily be circumvented. Previous computation steps directly impact later steps in the algorithm, and parallelizing those dependent steps can prove difficult. My solution is to express both the encoding and decoding portions of LZ77 in terms of prefix sums, union-find operations, and other parallelizable computations. The results show that this methodology is effective in improving throughput. Compared to codes from the literature, my CUDA implementation is an order of magnitude faster but tends to have a lower compression ratio.
dc.description.departmentComputer Science
dc.formatText
dc.format.extent55 pages
dc.format.medium1 file (.pdf)
dc.identifier.citationWesley, K. (2022). Massively parallel LZ77 compression and decompression on the GPU (Unpublished thesis). Texas State University, San Marcos, Texas.
dc.identifier.urihttps://hdl.handle.net/10877/16093
dc.language.isoen
dc.subjectParallelized LZ77
dc.subjectLossless parallel compression and decompression
dc.titleMassively Parallel LZ77 Compression and Decompression on the GPU
dc.typeThesis
thesis.degree.departmentComputer Science
thesis.degree.disciplineComputer Science
thesis.degree.grantorTexas State University
thesis.degree.levelMasters
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
WESLEY-THESIS-2022.pdf
Size:
813.63 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
LICENSE.txt
Size:
2.96 KB
Format:
Plain Text
Description: