Home // INFOCOMP 2011, The First International Conference on Advanced Communications and Computation // View article

LZW versus Sliding Window Compression on a Distributed System: Robustness and Communication

Authors:
Sergio De Agostino

Keywords: dictionary-based compression, string factorization, parallel complexity, distributed algorithm

Abstract:
Scalability preserves the robustness of sliding window compression only on very large files when it is implemented on a distributed system with low communication cost. On the other hand, we show that Lempel-Ziv-Welch compression is scalable and robust on arbitrary files.

Pages: 125 to 130

Copyright: Copyright (c) IARIA, 2011

Publication date: October 23, 2011

Published in: conference

ISSN: 2308-3484

ISBN: 978-1-61208-161-8

Location: Barcelona, Spain

Dates: from October 23, 2011 to October 29, 2011