Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

How Branch Mispredictions Affect Quicksort


Kaligosi,  Kanela
Algorithms and Complexity, MPI for Informatics, Max Planck Society;


Sanders,  Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Kaligosi, K., & Sanders, P. (2006). How Branch Mispredictions Affect Quicksort. In Algorithms - ESA 2006, 14th Annual European Symposium (pp. 780-791). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2318-D
We explain the counterintuitive observation that finding “good” pivots (close to the median of the array to be partitioned) may not improve performance of quicksort. Indeed, an intentionally skewed pivot improves performance. The reason is that while the instruction count decreases with the quality of the pivot, the likelihood that the direction of a branch is mispredicted also goes up. We analyze the effect of simple branch prediction schemes and measure the effects on real hardware.