Home // ADVCOMP 2014, The Eighth International Conference on Advanced Engineering Computing and Applications in Sciences // View article

The Greedy Approach to Dictionary-Based Static Text Compression on a Distributed System

Authors:
Sergio De Agostino

Keywords: lossless compression, string factorization, parallel computing, distributed system, scalability, robustness

Abstract:
The greedy approach to dictionary-based static text compression can be executed by a finite state machine. When it is applied in parallel to different blocks of data independently, there is no lack of robustness even on standard large scale distributed systems with input files of arbitrary size. Beyond standard large scale, a negative effect on the compression effectiveness is caused by the very small size of the data blocks. A robust approach for extreme distributed systems is presented in this paper, where this problem is fixed by overlapping adjacent blocks and preprocessing the neighborhoods of the boundaries.

Pages: 1 to 6

Copyright: Copyright (c) IARIA, 2014

Publication date: August 24, 2014

Published in: conference

ISSN: 2308-4499

ISBN: 978-1-61208-354-4

Location: Rome, Italy

Dates: from August 24, 2014 to August 28, 2014