Engineering parallel string sorting

DOI10.1007/s00453-015-0071-1zbMath1359.68056arXiv1403.2056OpenAlexW1574212840MaRDI QIDQ513306

Andreas Eberle, Timo Bingmann, Peter Sanders

Publication date: 6 March 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.2056

zbMATH Keywords

LCP-insertion sortLCP-merge sortmerge sortparallel string sortingsample sortstring sortingsuper scalar string sample sort

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Related Items (1)

Practical Performance of Space Efficient Data Structures for Longest Common Extensions.

Uses Software

• MCSTL
• Quicksort
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• On demand string sorting over unbounded alphabets
• Replacing suffix trees with enhanced suffix arrays
• Scanning multiple sequences via cache memory
• Optimal parallel string algorithms
• Parallel String Sample Sort
• Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing
• Cache-efficient string sorting using copying
• Parallel Merge Sort
• Optimal Parallel Sorting Scheme by Order Statistics
• The Parallel Evaluation of General Arithmetic Expressions
• Engineering burstsort
• Power balance and apportionment algorithms for the United States Congress
• Fast priority queues for cached memory
• Cache-conscious sorting of large sets of strings with dynamic tries
• Algorithms – ESA 2004
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
• Quicksort

This page was built for publication: Engineering parallel string sorting