Work-Optimal Parallel Decoders for LZ2 Data Compression

Authors:
Sergio de Agostino
Affiliations:
-
Venue:
DCC '00 Proceedings of the Conference on Data Compression
Year:
2000

Citing 14
Cited 0

Data compression: methods and theory

Data compression: methods and theory
Text compression

Text compression
Efficient parallel algorithms to test square-freeness and factorize strings

Information Processing Letters
P-complete problems in data compression

Theoretical Computer Science
Optimal parallel dictionary matching and compression (extended abstract)

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
A parallel decoding algorithm for LZ2 data compression

Parallel Computing
Common phrases and minimum-space text storage

Communications of the ACM
String Matching with Preprocessing of Text and Pattern

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Parsing with suffix and prefix dictionaries

DCC '96 Proceedings of the Conference on Data Compression
A Parallel Decoder for LZ2 Compression using the ID Update Heuristic

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Parallel algorithms for the static dictionary compression

DCC '95 Proceedings of the Conference on Data Compression
Near optimal compression with respect to a static dictionary on a practical massively parallel architecture

DCC '95 Proceedings of the Conference on Data Compression
A Technique for High-Performance Data Compression

Computer
An optimal randomized parallel algorithm for finding connected components in a graph

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The LZ2 compression method seems hardly parallelizable since some related heuristics are known to be P-complete. In spite of such negative result, the decoding process can be parallelized efficiently.In this paper, we show a work-optimal parallel decoding Las Vegas algorithm for text compressed by a standard implementation of the LZ2 algorithm (next character heuristic). The algorithm works in expected logarithmic time on a PRAM CRCW.We also address a different implementation called identity heuristic. In this case, we need to make the realistic assumption that the length of the dictionary elements is logarithmic in order to decode with optimal parallel work. The algorithm takes deterministic logarithmic time on a PRAM CREW.