Parallel Data Compression Techniques

2023/06/19 by David Noel, Noel, David, Elizabeth Graham +3
Computer Science · #Advanced Data Compression Techniques #Algorithms and Data Compression #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)

paper · pdf · doi:10.48550/arxiv.2306.11070

openalex publication_date 2023/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

With endless amounts of data and very limited bandwidth, fast data compression is one solution for the growing datasharing problem. Compression helps lower transfer times and save memory, but if the compression takes too long, this no longer seems viable. Multi-core processors enable parallel data compression; however, parallelizing the algorithms is anything but straightforward since compression is inherently serial. This paper explores techniques to parallelize three compression schemes: Huffman coding, LZSS, and MP3 coding

Related

• A Survey of Data Compression Algorithms and their Applications
• COMPARATIVE ANALYSIS AND PERFORMANCE EVALUATION OF HUFFMAN AND SHANNON FANO DATA COMPRESSION ALGORITHMS USING THE REDUCTION OF STORAGE SIZE OF A GIVEN DATA STRING.
• Compression Performance Analysis of Different File Formats
• Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures
• EDPC: Accelerating Lossless Compression via Lightweight Probability Models and Decoupled Parallel Dataflow