Parallel algorithms for optimal compression using dictionaries with the prefix property

The authors study parallel algorithms for lossless data compression via textual substitution. Dynamic dictionary compression is known to be P-complete, however, if the dictionary is given in advance, they show that compression can be efficiently parallelized and a computational advantage is obtained when the dictionary has the prefix property. The approach can be generalized to the sliding window method where the dictionary is a window that passes continuously from left to right over the input string.<<ETX>>

[1]  Roland Zito-Wolf A broadcast/reduce architecture for high-speed data compression , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[2]  James A. Storer,et al.  A Parallel Architecture for High-Speed Data Compression , 1991, J. Parallel Distributed Comput..

[3]  James A. Storer,et al.  Data Compression: Methods and Theory , 1987 .

[4]  Robert A. Wagner,et al.  Common phrases and minimum-space text storage , 1973, CACM.

[5]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[6]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[7]  Alan Hartman,et al.  Optimal Parsing of Strings , 1985 .

[8]  James A. Storer,et al.  Parallel algorithms for data compression , 1985, JACM.

[9]  Moni Naor String Matching with Preprocessing of Text and Pattern , 1991, ICALP.

[10]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.