BlockQuicksort: avoiding branch mispredictions in Quicksort
From MaRDI portal
Recommendations
Cites work
- Adaptive sampling strategies for quickselects
- Algorithms and Data Structures
- Algorithms – ESA 2004
- An experimental study of sorting and branch prediction
- Analysis of Branch Misses in Quicksort
- Analysis of Hoare's FIND algorithm with Median-of-three partition
- Average case analysis of Java 7's dual pivot quicksort
- Average case and distributional analysis of dual-pivot quicksort
- BlockQuicksort: avoiding branch mispredictions in Quicksort
- Engineering a cache-oblivious sorting algorithm
- Expected time bounds for selection
- Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4--6, 2012. Proceedings
- How Branch Mispredictions Affect Quicksort
- How good is multi-pivot quicksort?
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1820639 (Why is no real title available?)
- scientific article; zbMATH DE number 6469176 (Why is no real title available?)
- Implementing Quicksort programs
- In-place parallel super scalar samplesort (\(\mathrm{IPS}^4\mathrm{o}\))
- Introduction to algorithms
- Multi-pivot quicksort: theory and experiments
- On Floyd and Rivest's SELECT algorithm
- Optimal Partitioning for Dual Pivot Quicksort
- Optimal sampling strategies in Quicksort and Quickselect
- The analysis of Quicksort programs
- The Influence of Caches on the Performance of Sorting
Cited in
(4)
This page was built for publication: BlockQuicksort: avoiding branch mispredictions in Quicksort
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629535)
