Cited By
View all- Axtmann MWitt SFerizovic DSanders P(2022)Engineering In-place (Shared-memory) Sorting AlgorithmsACM Transactions on Parallel Computing10.1145/35052869:1(1-62)Online publication date: 31-Mar-2022
Most contemporary processors offer some version of Single Instruction Multiple Data (SIMD) machinery - vector registers and instructions to manipulate data stored in such registers. The central idea of this paper is to use these SIMD resources to ...
Sorting is a central problem in computer science and one of the key components of many applications. To the best of our knowledge, no reactive programming implementation of sorting algorithms has ever been presented.
In this paper we present reactive ...
Twenty-five comparators are minimal to sort nine inputs.Twenty-nine comparators are minimal to sort ten inputs.New symmetry-breaking results control the growth of the search space.Optimized and parallelized algorithms for generating size-optimal sorting ...
Springer-Verlag
Berlin, Heidelberg
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in