Faster sorting with SIMD CUDA intrinsics

Full code on Github: https://github.com/wiwa/blog-code/ Hi Link to heading Recently, I finished a batch at the Recurse Center… is what I would have said if this post were written when I intended to write it (i.e. 3 months ago). My project there focused on a questionable application of CUDA (mostly irrelevant to this post), but it got me thinking more about other GPU-friendly algorithms. Instead of my Recurse project (which I hope to write about in a later post), I want to simply begin writing about technical stuff I’ve played around with.

Sorting Algorithms with CUDA! | Ashwani Rathee

A simple, whitespace theme for academics. Based on [*folio](https://github.com/bogoli/-folio) design.

3 ways to sort a list unique

Today I would like to show you a performance table comparing different ways to sort a list/array unique. Sometimes it is necessary to sort a list or an array unique to get rid of duplicates this can b...

Blog | Finn Freitag

Blog articles around software development by Finn Freitag.

Bevor Sie zu YouTube weitergehen

Google DeepMind’s game-playing AI just found another way to make code faster

The AI-generated algorithms are already being used by millions of developers.

Linear-Time Sorter for FPGAs

Sorting Algorithms might be an old hat for computer scientists, but running times on the fastest of these algorithms is usually O(Nlog(N)) on a single core. I thought, with an FPGA, why not try a parallel approach in hardware to bring the running time down to O(N)? A few head-scratching evenings later–behold–the Linear-Time-Sorter was born! I’m jazzed to mock this up as an SPI-peripheral for a microcontroller. Feel free to make use of the source files as you need.