Adaptive online data compression
- 1 January 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Quickly transmitting large datasets in the context of distributed computing on wide area networks can be achieved by compressing data before transmission, However such an approach is not efficient when dealing with higher speed networks. Indeed, the time to compress a large file and to send it is greater than the time to send the uncompressed file. In this paper we explore and enhance an algorithm that allows us to overlap communications with compression and to automatically adapt the compression effort to currently available network and processor resources.Keywords
This publication has 9 references indexed in Scilit:
- Scilab to Scilab//: The Ouragan projectParallel Computing, 2001
- Adaptive end-to-end compression for variable-bandwidth communicationComputer Networks, 1999
- Ninf: A network based information library for global world-wide computing infrastructurePublished by Springer Nature ,1997
- Optimal grain size computation for pipelined algorithmsPublished by Springer Nature ,1996
- Data compressionACM Computing Surveys, 1987
- A Technique for High-Performance Data CompressionComputer, 1984
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952