Abstract
Parallel algorithms for lossless data compression via dictionary compression using optimal and greedy parsing strategies are described. Dictionary compression removes redundancy by replacing substrings of the input by references to strings stored in a dictionary. Given a static dictionary stored as a suffix tree, the authors present a parallel random access concurrent read, concurrent write (PRAM CREW) algorithm for optimal compression which runs in O(M+log M log n) time with O(nM/sup 2/) processors, where it is assumed that M is the maximum length of any dictionary entry. They also describe an O(M+log n) time and O(n) processor algorithm for greedy parsing given a static or sliding-window dictionary. For sliding-window compression. A different approach finds the greedy parsing in O(log n) time using O(nM log M/log n) processors. Their algorithms are practical in the sense that their analysis elicits small constants. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
