Parallel compression with cooperative dictionary construction
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 200-209
- https://doi.org/10.1109/dcc.1996.488325
Abstract
It is often desirable to compress or decompress relatively small blocks of data at high bandwidth and low latency (for example, for data fetches across a high speed network). Sequential compression may not satisfy the speed requirement, while simply splitting the block into smaller subblocks for parallel compression yields poor compression performance due to small dictionary sizes. We consider an intermediate approach, where multiple compressors jointly construct a dictionary. The result is parallel speedup, with compression performance similar to the sequential case.Keywords
This publication has 3 references indexed in Scilit:
- The effect of non-greedy parsing in Ziv-Lempel compression methodsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Data compression via textual substitutionJournal of the ACM, 1982
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977