Multiple Processor Approach to Data Compression'

1
Multiple ProcessorApproach to Data Compression.

• Daniel Kofi Kakra Opoku-Frempong.

2
Introduction

• What is the Multiple Processor Approach (MPA)?
• Why compression in Processors?
• Different compression techniques used
• The Dictionary Technique
• Diagrams
• Conclusion
• Questions

3
What is the Multiple Processor Approach (MPA)?

• The arrangement of processors in a pipeline
  architecture and passing data between them.
• Pioneered by James Storer.

4
Why compression in Processors?

• Computer Storage
• Transmission line Bandwidth
• Speed up performance

5
Compression Tecniques

• Huffman
• Wavelet
• JPEG
• MPEG
• Dictionary Technique (DT)

6
Main characteristics of DT

• Lossless
• Applicable to any data type
• Example (Graphic, Text , etc)

7
Dynamic Dictionary ProcessorModel
8
Cont. of DT

• Buf A and B operate as data stream for the
  symbols to pass through.
• StorA and B operate as library locations which
  store a single or code word.
• Processor index funcitons as the word that is
  associated with the library content.
• The processor embodies logic to compare the
  stored library content to to the data stream.

9
Cont. of DT

• Leader
• Local Compression
• 8bit symbols are replaced with 12bit code if
  there are matches between buffers.
• 1612 43 or a 25 savings in space.

10
Conclusion

• Speedup doubled as number of processes increase.
• Compression ratio decrease as number of process
  decrease.

11
BIBLIOGRAPHY

• A. Turpin, W. F. Smyth. An approach to phrase
  selection for offline data compression. Jan
  2002. School of computing Curtin University of
  Technology.
• John L. Simpson, Chaman L. Sabharwal. A multiple
  approach to data compression. Soutwest bell at
  St. Louis.
• Levinson, H., "Compression Technology And Channel
  Extension," Enterprise Systems Journal, March
  1995, pp. 60-82.
• B. A. Nayfeh, K. Olukotun Exploring the design
  space for a shired cache-multiprocessor April
  1994. Computer Systems Lab. CA 9043.

12
Questions.

• ?
•