Parallel Data Compression Techniques

06/19/2023
by   David Noel, et al.
0

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

READ FULL TEXT

page 4

page 6

research
08/18/2021

Big Data in Astroinformatics – Compression of Scanned Astronomical Photographic Plates

Construction of Scanned Astronomical Photographic Plates(SAPPs) database...
research
11/01/2022

Survey on Source-coding technique

Shannon separation theorem lays the foundation for traditional image com...
research
06/22/2022

ROIBIN-SZ: Fast and Science-Preserving Compression for Serial Crystallography

Crystallography is the leading technique to study atomic structures of p...
research
11/01/2021

iFlow: Numerically Invertible Flows for Efficient Lossless Compression via a Uniform Coder

It was estimated that the world produced 59 ZB (5.9 × 10^13 GB) of data ...
research
06/20/2023

About some compression algorithms

We use neural network algorithms for finding compression methods of imag...
research
06/11/2019

ROOT I/O compression algorithms and their performance impact within Run 3

The LHCs Run3 will push the envelope on data-intensive workflows and, si...
research
03/29/2019

User Preference Aware Lossless Data Compression at the Edge

Data compression is an efficient technique to save data storage and tran...

Please sign up or login with your details

Forgot password? Click here to reset