A deterministic BSP algorithm for constructing the suffix array of a given string is presented, based on a technique that we call accelerated sampling. It runs in optimal O(np) local computation and communication, and requires a near optimal O(log logp) supersteps. The algorithm provides an improvement over the synchronisation costs of existing algorithms, and reinforces the importance of the sampling technique. © Czech Technical University in Prague, Czech Republic.