Succinct parallel Lempel-Ziv factorization on a multicore computer

This article proposes a succinct parallel algorithm, called pLZone, to compute the Lempel-Ziv (LZ77) factorization of a size-n input string over a constant alphabet in O(n) time using approximately a small n-word workspace, where each word occupies inverted right perpendicularlogninverted left perpendicular. bits. pLZone is designed by dividing the computing process of the sequential factorization algorithm LZone into multiple stages that are organized as a pipeline to perform operations in parallel for acceleration, and a checking method is integrated into the pipeline to efficiently verify the output to prevent bugs during implementation. A performance evaluation experiment is conducted by running pLZone and the existing representative algorithms on a set of realistic and artificial datasets. Both the best time and space results are achieved by our proposed algorithm, which suggests that this work could provide a potential solution for efficient LZ77 computation.