Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2412.10160 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913610737909760 |
|---|---|
| author | Haag, Manuel Kurpicz, Florian Sanders, Peter Schimek, Matthias |
| author_facet | Haag, Manuel Kurpicz, Florian Sanders, Peter Schimek, Matthias |
| contents | We present first algorithmic ideas for a practical and lightweight adaption of the DCX suffix array construction algorithm [Sanders et al., 2003] to the distributed-memory setting. Our approach relies on a bucketing technique which enables a lightweight implementation which uses less than half of the memory required by the currently fastest distributed-memory suffix array algorithm PSAC [Flick and Aluru, 2015] while being competitive or even faster in terms of running time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_10160 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fast and Lightweight Distributed Suffix Array Construction -- First Results Haag, Manuel Kurpicz, Florian Sanders, Peter Schimek, Matthias Data Structures and Algorithms We present first algorithmic ideas for a practical and lightweight adaption of the DCX suffix array construction algorithm [Sanders et al., 2003] to the distributed-memory setting. Our approach relies on a bucketing technique which enables a lightweight implementation which uses less than half of the memory required by the currently fastest distributed-memory suffix array algorithm PSAC [Flick and Aluru, 2015] while being competitive or even faster in terms of running time. |
| title | Fast and Lightweight Distributed Suffix Array Construction -- First Results |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2412.10160 |