A scheme for data compression in supercomputers

Authors:
M. A. Bassiouni;N. Ranganathan;A. Mukherjee
Affiliations:
Department of Computer Science, University of Central Florida, Orlando, Florida;Department of Computer Science, University of Central Florida, Orlando, Florida;Department of Computer Science, University of Central Florida, Orlando, Florida
Venue:
Proceedings of the 1988 ACM/IEEE conference on Supercomputing
Year:
1988

Citing 6
Cited 0

Supercomputing

Computer - IEEE Centennial: the state of computing
Data Compression in Scientific and Statistical Databases

IEEE Transactions on Software Engineering
Introduction to nMOS & VLSI systems design

Introduction to nMOS & VLSI systems design
Double encoding—A technique for reducing storage requirement of text

Information Systems
Peak vs. Sustained Performance in Highly Concurrent Vector Machines

Computer
Arithmetic coding for data compression

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

There is a growing recognition of the importance of efficient coding and data compression schemes in supercomputing centers and in networks of high-speed computing machines. Recently, there has been a considerable interest in arithmetic coding as a promising technique for reducing the cost of data storage and transmission. In this paper, we present a compression algorithm that is tailored to utilize the enormous speed and memory size of supercomputers and which utilizes an enhanced arithmetic coding scheme. The paper also presents efficient VLSI designs for the enhanced scheme. These hardware designs are suitable for inclusion in disk and communication controllers of supercomputers and would provide a practical way to effectively increase thresholds of data transfer rates and communication bandwidth.