Dual-pivot and beyond: The potential of multiway partitioning in quicksort
| dc.contributor.author | Wild, Sebastian | |
| dc.date.accessioned | 2021-06-21T10:10:38Z | |
| dc.date.available | 2021-06-21T10:10:38Z | |
| dc.date.issued | 2018 | |
| dc.description.abstract | Since 2011 the Java runtime library uses a Quicksort variant with two pivot elements. For reasons that remained unclear for years it is faster than the previous Quicksort implementation by more than 10 %; this is not only surprising because the previous code was highly-tuned and is used in many programming libraries, but also since earlier theoretical investigations suggested that using several pivots in Quicksort is not helpful. In my dissertation I proved by a comprehensive mathematical analysis of all sensible Quicksort partitioning variants that (a) indeed there is hardly any advantage to be gained from multiway partitioning in terms of the number of comparisons (and more generally in terms of CPU costs), but (b) multiway partitioning does significantly reduce the amount of data to be moved between CPU and main memory. Moreover, this more efficient use of the memory hierarchy is not achieved by any of the other well-known optimizations of Quicksort, but only through the use of several pivots. | en |
| dc.identifier.doi | 10.1515/itit-2018-0012 | |
| dc.identifier.pissn | 2196-7032 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/36610 | |
| dc.language.iso | en | |
| dc.publisher | De Gruyter | |
| dc.relation.ispartof | it - Information Technology: Vol. 60, No. 3 | |
| dc.subject | Quicksort | |
| dc.subject | multiway partitioning | |
| dc.subject | average-case analysis | |
| dc.subject | cache misses | |
| dc.subject | external-memory model | |
| dc.title | Dual-pivot and beyond: The potential of multiway partitioning in quicksort | en |
| dc.type | Text/Journal Article | |
| gi.citation.endPage | 177 | |
| gi.citation.publisherPlace | Berlin | |
| gi.citation.startPage | 173 |