Modern deep learning applications urge to push the model inference taking place at the
edge devices for multiple reasons such as achieving shorter latency, relieving the burden of …

Sorting all suffixes of an input string will produce the suffix array that is a fundamental data
structure for full-text search on. To utilize the parallel computing power of a multicore …

Sorting the suffixes of an input string is a fundamental task in many applications such as
data compression, genome alignment, and full-text search. The induced sorting (IS) method …

Lossless data compression has evolved into an indispensable tool for reducing data transfer
times in heterogeneous systems. However, performing decompression on host systems can …

The suffix array is a crucial data structure for efficient string analysis. Over the course of
twenty-six years, sequential suffix array construction algorithms have achieved O (n) time …

This dissertation focuses on two fundamental sorting problems: string sorting and suffix
sorting. The first part considers parallel string sorting on shared-memory multi-core …

Nowadays, a growing number of servers and workstations feature an increasing number of
GPUs. However, slow communication among GPUs can lead to poor application …

Suffix arrays and trees are important and fundamental string data structures which lie at the
foundation of many string algorithms, with important applications in computational biology …

The suffix array is a fundamental data structure to support string analysis efficiently. It took
about 26 years for the sequential suffix array construction algorithm to achieve O (n) time …

We present a practical comparison of suffix array construction algorithms on modern
hardware. The benchmark is conducted using our new benchmark framework SACABench …