2016
DOI: 10.1002/cpe.3867
|View full text |Cite
|
Sign up to set email alerts
|

Fast parallel skew and prefix‐doubling suffix array construction on the GPU

Abstract: Summary Suffix arrays are fundamental full‐text index data structures of importance to a broad spectrum of applications in such fields as bioinformatics, Burrows–Wheeler transform‐based lossless data compression, and information retrieval. In this work, we propose and implement two massively parallel approaches on the graphics processing unit (GPU) based on two classes of suffix array construction algorithms. The first, parallel skew, makes algorithmic improvements to the previous work of Deo and Keely to achi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 32 publications
(80 reference statements)
0
4
0
Order By: Relevance
“…We used segmented sorting to optimize the argsort for CNN models as illustrated in Figure 2. Note that although our implementation uses similar ideas as in previous segmented sort work [16] and merge sort work [38], it is not limited to Nvidia GPUs but uses the unified program to run efficiently on different integrated GPUs with different architectures.…”
Section: Vision-specific Operatorsmentioning
confidence: 99%
“…We used segmented sorting to optimize the argsort for CNN models as illustrated in Figure 2. Note that although our implementation uses similar ideas as in previous segmented sort work [16] and merge sort work [38], it is not limited to Nvidia GPUs but uses the unified program to run efficiently on different integrated GPUs with different architectures.…”
Section: Vision-specific Operatorsmentioning
confidence: 99%
“…We compare our GPU SACA with three shared memory parallel SACAs. We could not compare our algorithm with the most recent GPU-algorithm by Wang et al [47], we could only run it successfully for inputs smaller than 100 KiB for our text collection. (To test their code, they use somehow meaningless random input texts, which we could get to work in our test environment for sizes up to 170 MiB.…”
Section: Evaluation Of Parallel Suffix Array Construction Algorithmsmentioning
confidence: 99%
“…It is generally accepted that the Divsufsort [12,33] is the fastest SACA-despite it having a superlinear running time. Different models of computation have also been considered for this problem: external memory, e. g., [5,9,18,19,20,38], shared memory, e. g., [20,20,25], distributed memory, e. g., [1,6,13,14,20,32,36], and GPGPU, e. g., [10,41,46,47].…”
Section: Introductionmentioning
confidence: 99%
“…The paper Fast parallel skew and prefix‐doubling suffix array construction on the GPU , authored by Leyuan Wang, Sean Baxter and John D. Owens , proposes a hybrid GPU implementation of known algorithms for constructing suffix arrays of a string that fits the given GPU architecture best. One highlight pointed out in the reviews is a highly efficient segmented sorting primitive, which is also valuable as independent result.…”
mentioning
confidence: 99%