LCP-Array Construction in Distributed Memory
The main objective of this Master's thesis is to experimentally evaluate whether the computation of the LCP-array based on the SA is also faster than the simultaneous construction in distributed memory. To this end, at least one distributed memory LCP-array construction algorithm that uses the SA has to be developed, because at the present time, there exists only one implementation of a distributed memory LCP-array construction algorithm, which computes the SA and LCP-array at the same time. Existing distributed memory SA construction algorithms can be used as staring point.
See the detailed description for more details.