Tag Archives: bitonic

SSE2 odd-even merge (the last step in sorting)

If you’ve looked at my example of bitonic sort in SSE2 in ASM or in “C”, you’ll see that the clever stuff ends with two eight-element sorted sequences. The final step is a simple loop that merges the two sequences. … Continue reading

Posted in Uncategorized | Tagged , , , , | 1 Comment

Update on bitonic SSE2 sort of 16 doubles

For the complete source code for both sorting and ranking functions using SSE2, check out ssesort.c in this github repo I originally used asm to generate the bitonic sorter. After doing a little more testing, I found that gcc 4.4 … Continue reading

Posted in algorithm | Tagged , , , | 5 Comments