This library implements a distributed-memory parallel algorithm for the
construction of suffix and LCP arrays. The algorithm is implemented in C++11
and MPI
.
The algorithm implemented by this codebase is described in the following peer-reviewed publication. Please cite this paper, when using our code for academic purposes:
Flick, Patrick, and Srinivas Aluru. "Parallel distributed memory construction of suffix and longest common prefix arrays." Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, ACM, 2015.
include/
contains the implementation of our algorithms in form of C++ template header files (a header-only library).src/
contains the sources for binaries, which make use of the implementations ininclude/
.test
contains unit tests for the components of the library.ext/
contains external, third-party dependencies/libraries. See the README for details on the third-party libraries used.
cmake
version >= 2.6- C++11 compatible compiler (tested with gcc and clang)
- an
MPI
implementation supportingMPI-2
orMPI-3
. - external (third-party) dependencies are included in the
ext/
directory
To compile the executables and tests via cmake run the following:
mkdir build
cd build
cmake -D CMAKE_BUILD_TYPE=Release ../
make
After compiling, there will a multiple binaries available in the build/bin
folder. Running --help
on them will give more detailed usage information.
Here's a short overview over the different binaries and their function:
psac
is our main executable. This will construct the suffix and LCP array of a given input file. Run withmpirun
for parallel execution.benchmark_sac
benchmarks multiple of our methods. Run withmpirun
.dss
is a wrapper aroundlibdivsufsort
that follows the same command line usage as our other binaries. This is a sequential program. No mpirun needed.psac-vs-dss
runs both our suffix array construction andlibdivsufsort
, verifies the results against each other and outputs run-times of both.test_*
various test executables, testing a variety of our internal methods.
Our code is licensed under the
Apache License 2.0 (see LICENSE
).
The licensing does not apply to the ext
folder, which contains external
dependencies which are under their own licensing terms.