Scalable distributed string sorting

DOI10.4230/LIPICS.ESA.2024.83MaRDI QIDQ7253152zbMATH OpenFDO

Authors Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek

Publication date 26 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2024.83

zbMATH Keywords

distributed membership filtersdistributed-memory computingscalabilitysortingstrings

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Engineering parallel string sorting
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 6472611 (Why is no real title available?)
• Lightweight distributed suffix array construction
• Linear work suffix array construction
• Merging multiple lists on hierarchical-memory multiprocessors
• On the versatility of parallel sorting by regular sampling
• Optimal parallel string algorithms: sorting, merging and computing the minimum
• Parallel sorting by regular sampling
• Parallel string sample sort
• Robust massively parallel sorting
• Sequential and parallel algorithms and data structures. The basic toolbox
• Sorting strings and constructing digital search trees in parallel
• The string B-tree

Cited in

(1)

• Fast and lightweight distributed suffix array construction

This page was built for publication: Scalable distributed string sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253152)