Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files

DOI10.3390/a10010021zbMath1461.68073OpenAlexW2582368030MaRDI QIDQ1662611

Bruno Carpentieri, Sergio De Agostino, Raffaele Pizzolante

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a10010021

zbMATH Keywords

decodingPRAMMapReduceLZ compression

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• P-complete problems in data compression
• Lempel-Ziv data compression on parallel and distributed systems
• An Efficient Parallel Biconnectivity Algorithm
• Data compression via textual substitution
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding

This page was built for publication: Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files