Parallel Suffix Array Construction by Accelerated Sampling

TL;DR

This paper introduces a deterministic BSP algorithm for suffix array construction that uses accelerated sampling to achieve optimal local computation, minimal synchronization, and improved efficiency over existing methods.

Contribution

It presents a novel accelerated sampling technique for suffix array construction that reduces synchronization costs and improves performance in parallel computing environments.

Findings

Achieves optimal O(n/p) local computation and communication

Requires near optimal O(log log p) synchronization steps

Improves over existing algorithms in synchronization efficiency

Abstract

A deterministic BSP algorithm for constructing the suffix array of a given string is presented, based on a technique which we call accelerated sampling. It runs in optimal O(n/p) local computation and communication, and requires a near optimal O(log log p) synchronisation steps. The algorithm provides an improvement over the synchronisation costs of existing algorithms, and reinforces the importance of the sampling technique.