An experimental study of sorting and branch prediction

DOI10.1145/1227161.1370599MaRDI QIDQ5269274zbMATH OpenOpenAlexFDO

Authors

Publication date 15 June 2017

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1227161.1370599

zbMATH Keywords

branch predictioncachingpipeline architecturessorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• How Branch Mispredictions Affect Quicksort
• Algorithms and Data Structures
• The Influence of Caches on the Performance of Sorting
• An experimental analysis of parallel sorting algorithms
• BlockQuicksort: avoiding branch mispredictions in Quicksort

Cited in

(5)

• Good predictions are worth a few comparisons
• BlockQuicksort: avoiding branch mispredictions in Quicksort
• BlockQuicksort: avoiding branch mispredictions in Quicksort
• Algorithms and Data Structures
• How Branch Mispredictions Affect Quicksort

This page was built for publication: An experimental study of sorting and branch prediction

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