A parallel decoding algorithm for LZ2 data compression

The LZ2 compression method is hardly parallelizable since it is known to be P-complete. In spite of such negative result, we show in this paper that the decoding process can be parallelized efficiently on an EREW PRAM model of computation with O(n/log(n)) processors and O(log2n) time, where n is the...

Full description

Saved in:
Bibliographic Details
Published in:Parallel computing Vol. 21; no. 12; pp. 1957 - 1961
Main Author: De Agostino, Sergio
Format: Journal Article
Language:English
Published: Elsevier B.V 01.12.1995
Subjects:
Compression algorithm
Decoding
Parallel algorithm
Textual substitution
Textual substitution
Parallel algorithm
Compression algorithm
Decoding
ISSN:0167-8191, 1872-7336
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The LZ2 compression method is hardly parallelizable since it is known to be P-complete. In spite of such negative result, we show in this paper that the decoding process can be parallelized efficiently on an EREW PRAM model of computation with O(n/log(n)) processors and O(log2n) time, where n is the length of the output string.
ISSN:0167-8191
1872-7336
DOI:10.1016/0167-8191(95)01030-0