Learn More
The MapReduce framework has been generating a lot of interest in a wide range of areas. It has been widely adopted in industry and has been used to solve a number of non-trivial problems in academia. Putting MapReduce on strong theoretical foundations is crucial in understanding its capabilities. This work links MapReduce to the BSP model of computation,(More)
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(n p) local computation and communication, and requires a near optimal O(log log p) supersteps. The algorithm provides an improvement over the synchronisa-tion costs of existing(More)
  • 1