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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel computing Jg. 21; H. 12; S. 1957 - 1961
1. Verfasser: De Agostino, Sergio
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.12.1995
Schlagworte:
Compression algorithm
Decoding
Parallel algorithm
Textual substitution
Textual substitution
Parallel algorithm
Compression algorithm
Decoding
ISSN:0167-8191, 1872-7336
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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