CS5199B THESIS DEFENSE PRESENTATION
Title: MASSIVELY PARALLEL LZ77 COMPRESSION AND DECOMPRESSION ON THE GPU
Presenter: Kayla Wesley
Advisor: Dr. Martin Burtscher
Date/Time: Friday, July 1st @ 3:00 p.m.
Location: https://txstate.zoom.us/my/martin.burtscher (no password required)
Parallelizing 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.
Deadline: July 24, 2022, midnight