Adaptive online data compression

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 gr...

Full description

Saved in:
Bibliographic Details
Published in11th International Symposium on High-Performance Distributed Computing (HPDC-11 2002) pp. 379 - 388
Main Authors Jeannot, E., Knutsson, B., Bjorkman, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2002
Subjects
Algorithm design and analysis
Bandwidth
Concurrent computing
Data compression
Distributed computing
File systems
Laboratories
LAN interconnection
Network servers
Spine
Online AccessGet full text
ISBN0769516866
9780769516868
ISSN1082-8907
DOI10.1109/HPDC.2002.1029938

Cover

More Information
Summary: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.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:0769516866
9780769516868
ISSN:1082-8907
DOI:10.1109/HPDC.2002.1029938