By Topic

Prediction-capable data compression algorithms for improving transmission efficiency on distributed systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hann-Huei Chiou ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; A. I-Chi Lai ; Chin-Laung Lei

Network bandwidth is a limited and precious resource in distributed computing environments. Insufficient bandwidth will severely degrade the performance of a distributed computing task in exchanging massive amounts of data among the networked hosts. A feasible solution to save bandwidth is to incorporate data compression during transmission. However blind, or unconditional, compression may only result in waste of CPU power and even slow down the overall network transfer rate, if the data to be transmitted are hard to compress. We present a prediction-capable lossless data compression algorithm to address this problem. By adapting to the compression speed of a host CPU, current system load, and network speed, our algorithm can accurately estimate the compression time of each data block given, and decide whether it should be compressed or not. Experimental results indicate that our prediction mechanism is both efficient and effective, achieving 93% of prediction accuracy at the cost of only 3.2% of the execution time of unconditional compression

Published in:

Distributed Computing Systems, 2000. Proceedings. 20th International Conference on

Date of Conference: