  With endless amounts of data and very limited bandwidth, fast data
compression is one solution for the growing datasharing problem. Compression
helps lower transfer times and save memory, but if the compression takes too
long, this no longer seems viable. Multi-core processors enable parallel data
compression; however, parallelizing the algorithms is anything but
straightforward since compression is inherently serial. This paper explores
techniques to parallelize three compression schemes: Huffman coding, LZSS, and
MP3 coding
