Agostino, S.D.; Carpentieri, B.; Pizzolante, R. Concurrent vs. Exclusive Reading in Parallel Decoding of LZ-Compressed Files. Algorithms2017, 10, 21.
Agostino, S.D.; Carpentieri, B.; Pizzolante, R. Concurrent vs. Exclusive Reading in Parallel Decoding of LZ-Compressed Files. Algorithms 2017, 10, 21.
Agostino, S.D.; Carpentieri, B.; Pizzolante, R. Concurrent vs. Exclusive Reading in Parallel Decoding of LZ-Compressed Files. Algorithms2017, 10, 21.
Agostino, S.D.; Carpentieri, B.; Pizzolante, R. Concurrent vs. Exclusive Reading in Parallel Decoding of LZ-Compressed Files. Algorithms 2017, 10, 21.
Abstract
Broadcasting a message from one to many processors in a network corresponds to concurrent reading on a random access shared memory parallel machine. Computing the trees of a forest, the level of each node in its tree and the path between two nodes are problems that can easily be solved with concurrent reading in a time logarithmic in the maximum height of a tree. Solving such problems with exclusive reading requires a time logarithmic in the number of nodes, implying message passing between disjoint pairs of processors on a distributed system. Allowing concurrent reading in parallel algorithm design for distributed computing might be advantageous in practice if these problems are faced on shallow trees with some specific constraints. We show an application to LZC-compressed file decoding, whose parallelization employs these computations on such trees for realistic data. On the other hand, zipped files do not have such advantage since they are compressed by the Lempel-Ziv sliding window technique.
Keywords
LZ compression; decoding; pram; mapreduce
Subject
Computer Science and Mathematics, Computer Science
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
