DocumentCode :
3265586
Title :
Parallel compression with cooperative dictionary construction
Author :
Franaszek, Peter ; Robinson, John ; Thomas, Joy
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fYear :
1996
fDate :
Mar/Apr 1996
Firstpage :
200
Lastpage :
209
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 :
data compression; decoding; encoding; parallel algorithms; compression performance; cooperative dictionary construction; data compression; data decompression; data fetches; decoding; encoding; high bandwidth; high speed network; low latency; parallel algorithm; parallel compression; parallel speedup; sequential compression; Bandwidth; Compressors; Decoding; Delay; Dictionaries; Hardware; High-speed networks; Huffman coding; Parallel algorithms; Systolic arrays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Compression Conference, 1996. DCC '96. Proceedings
Conference_Location :
Snowbird, UT
ISSN :
1068-0314
Print_ISBN :
0-8186-7358-3
Type :
conf
DOI :
10.1109/DCC.1996.488325
Filename :
488325
Link To Document :
بازگشت