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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel computing Ročník 21; číslo 12; s. 1957 - 1961
Hlavní autor: De Agostino, Sergio
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.12.1995
Témata:
Compression algorithm
Decoding
Parallel algorithm
Textual substitution
Textual substitution
Parallel algorithm
Compression algorithm
Decoding
ISSN:0167-8191, 1872-7336
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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