Almost work-optimal PRAM EREW decoders of LZ compressed text

Author

De Agostino, Sergio

Author_Institution

Dept. of Comput. Sci., Armstrong Atlantic State Univ., Savannah, GA, USA

fYear

2003

fDate

25-27 March 2003

Firstpage

422

Abstract

Summary form only given. The parallel complexity of LZ compression and decompression has been studied. Parallel algorithms have been designed for LZ1 compression and decompression. LZ2 compression is hardly parallelizable, since it is P-complete. A nearly work-optimal parallel decoding algorithm was shown which run on the PRAM EREW in O(log n) time with O(n/(log n)¹2 /) processors for text compressed with LZ1 and LZ2 methods. Pseudo work-optimal PRAM EREW decoders for finite window compression and LZ2 compression requiring logarithmic time with O(dn) work are presented. Finally, the PRAM EREW decoders requiring logarithmic time and O(n/log n) processors were observed that are possible with the non-conservative assumption. The algorithms employed the Euler tour technique and parallel integer sorting.

Keywords

computational complexity; data compression; decoding; parallel algorithms; sorting; text analysis; Euler tour technique; LZ compression; LZ decompression; PRAM EREW decoders; decoding; logarithmic time; parallel algorithms; parallel complexity; parallel decoding algorithm; parallel integer sorting; Decoding; Phase change random access memory;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 2003. Proceedings. DCC 2003

ISSN

1068-0314

Print_ISBN

0-7695-1896-6

Type

conf

DOI

10.1109/DCC.2003.1194041

Filename

1194041