<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Novel Hybrid Quicksort Algorithm Vectorized using AVX-512 on Intel Skylake · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1704.08579/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1704.08579/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Novel Hybrid Quicksort Algorithm Vectorized using AVX-512 on Intel Skylake — mentioned by orlp</title><link>https://news.ycombinator.com/item?id=31622930</link><guid isPermaLink="false">urn:hackerpapers:mention:1704.08579:31622930</guid><pubDate>Sat, 04 Jun 2022 17:21:40 GMT</pubDate><description>&lt;p&gt;SIMD based sorting isn&amp;#x27;t new, e.g. djbsort: https://sorting.cr.yp.to/. I find it strange the paper doesn&amp;#x27;t cite it or compare to it at all. EDIT: to be fair it does seem that Bramas&amp;#x27; first published work on SIMD sorting (that I could find) predates djbsort, https://arxiv.org/abs/1704.08579. A comparison would still be nice though.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1704.08579/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.MS</category></item><item><title>A Novel Hybrid Quicksort Algorithm Vectorized using AVX-512 on Intel Skylake — mentioned by ncmncm</title><link>https://news.ycombinator.com/item?id=23365558</link><guid isPermaLink="false">urn:hackerpapers:mention:1704.08579:23365558</guid><pubDate>Sat, 30 May 2020 22:54:42 GMT</pubDate><description>&lt;p&gt;If you define inline bool swap_if( bool c, int&amp;amp; a, int&amp;amp; b) { int ta = a, tb = b; a = c ? tb : ta; b = c ? ta : tb; return c; } and then use it in partition&amp;#x27;s inner loop like right += swap_if( *left &amp;lt; pivot, *left, *right); ..., compiled with Clang (which generates `cmov` instructions), a simplest-possible quicksort is more than twice as fast as `std::sort`. Then you can doctor up the endgame with heapsort, insertion sort, even bubble sort if you like, and get an incremental improvement. But using AVX machinery to implement an optimal sorting network for small arrays is faster, if you are…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1704.08579/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.MS</category></item><item><title>A Novel Hybrid Quicksort Algorithm Vectorized using AVX-512 on Intel Skylake — mentioned by ncmncm</title><link>https://news.ycombinator.com/item?id=23289377</link><guid isPermaLink="false">urn:hackerpapers:mention:1704.08579:23289377</guid><pubDate>Sun, 24 May 2020 05:33:48 GMT</pubDate><description>&lt;p&gt;AVX512 intrinsics are more powerful and better-suited for optimal sorting. https://arxiv.org/abs/1704.08579 Of course this presumes you have AVX512 hardware. (AMD gets it in Zen 3.) In the meantime, AVX2 will have to do.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1704.08579/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.MS</category></item><item><title>A Novel Hybrid Quicksort Algorithm Vectorized using AVX-512 on Intel Skylake — mentioned by zbjornson</title><link>https://news.ycombinator.com/item?id=23218786</link><guid isPermaLink="false">urn:hackerpapers:mention:1704.08579:23218786</guid><pubDate>Mon, 18 May 2020 05:44:11 GMT</pubDate><description>&lt;p&gt;For one: https://arxiv.org/abs/1704.08579&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1704.08579/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.MS</category></item></channel></rss>
