C++ template library for high performance SIMD based sorting algorithms - intel/x86-simd-sort

In this paper, we report on a new stable sorting algorithm that can take advantage of SIMD instructions while avoiding the frequent cache misses caused by the random memory accesses.

May 26, 2015 · I'm trying to find an O(n∙log(n)) sorting method to sort several arrays simultaneously so that an element in a multi-value array will represent elements from 4 different single value arrays and the sorting method would sort the multi-value elements.

Sep 19, 2018 · You can do it with SIMD, but how fast it is will depend on exactly what instruction sets you have available, and how clever you are in your implementation. One approach is to take the array and "sift" it to separate out elements that belong in different buckets. For example, grab 32 bytes from your array which will have 16 16-bit elements.

Dec 8, 2022 · To understand the basic concepts, I played around with the ideas from the paper Fast Quicksort Implementation Using AVX Instructions by Shay Gueron and Vlad Krasnov. They provide an implementation in (surprisingly readable) assembly on their github. Let's see how we can make SIMD sort.

Mar 9, 2024 · Today will be about a high-level overview of a particular kind of parallel sorting algorithm called bitonic sort . I’ll go over the context behind around algorithm, a few basics of SIMD programming, a CUDA implementation, and how a small optimization grants it a +30% performance uplift.

ChipSort.jl is a Julia module for SIMD and cache-aware sorting. It implements sorting networks and bitonic merge networks with SIMD instructions, with config-urable vector sizes. It also implements Combsort, which lends itself easily to vectorization and can achieve good performance depend-ing on the memory access cost.

In this paper, we accelerate the processing of tree-based in- dex structures by using SIMD instructions. We adapt the B+-Tree and preÞx B-Tree (trie) by changing the search al- gorithm on inner nodes from binary search to k-ary search.

Aug 31, 2015 · For sorting an array of structures with SIMD instructions, a frequently used approach is to first pack the key and index for each record into an integer value, sort the key-index pairs using SIMD instructions, then rearrange the records based on the sorted key-index pairs.

Dec 6, 2024 · This section reviews the design of a larger Bitonic SIMD sorting example for \(N=1024\) samples. This is more challenging than the previous \(N=16\) example because the entire array to be sorted no longer fits in the available vector register space.