Optimal-depth sorting networks
From MaRDI portal
Abstract: We solve a 40-year-old open problem on the depth optimality of sorting networks. In 1973, Donald E. Knuth detailed, in Volume 3 of "The Art of Computer Programming", sorting networks of the smallest depth known at the time for n =< 16 inputs, quoting optimality for n =< 8. In 1989, Parberry proved the optimality of the networks with 9 =< n =< 10 inputs. In this article, we present a general technique for obtaining such optimality results, and use it to prove the optimality of the remaining open cases of 11 =< n =< 16 inputs. We show how to exploit symmetry to construct a small set of two-layer networks on n inputs such that if there is a sorting network on n inputs of a given depth, then there is one whose first layers are in this set. For each network in the resulting set, we construct a propositional formula whose satisfiability is necessary for the existence of a sorting network of a given depth. Using an off-the-shelf SAT solver we show that the sorting networks listed by Knuth are optimal. For n =< 10 inputs, our algorithm is orders of magnitude faster than the prior ones.
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3409355 (Why is no real title available?)
- A computer-assisted optimal depth lower bound for nine-input sorting networks
- Applying sorting networks to synthesize optimized sorting libraries
- Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
- Bounds on the size of test sets for sorting and related networks
- Compiling finite domain constraints to SAT with BEE
- Computer-aided proof of Erdős discrepancy properties
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- New Bounds on Optimal Sorting Networks
- Optimal sorting networks
- Practical graph isomorphism. II.
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Sorting networks: the end game
- Sorting networks: to the end and back again
- Sorting nine inputs requires twenty-five comparisons
Cited in
(19)- Formally proving size optimality of sorting networks
- A lower bound for sorting networks based on the shuffle permutation
- scientific article; zbMATH DE number 4031004 (Why is no real title available?)
- New Bounds on Optimal Sorting Networks
- A computer-assisted optimal depth lower bound for nine-input sorting networks
- Optimizing sorting algorithms by using sorting networks
- Formalizing size-optimal sorting networks: extracting a certified proof checker
- The half cleaner lemma: constructing efficient interconnection networks from sorting networks
- Sorting nine inputs requires twenty-five comparisons
- Optimal sorting networks
- Sorting networks: to the end and back again
- Improved sorting networks with O(log N) depth
- Sorting-based selection algorithms for hypercubic networks
- Bitonic sorters of minimal depth
- Practical algorithms for finding extremal sets
- Sorting with Complete Networks of Stacks
- Sorting networks: the end game
- Sorting and counting networks of arbitrary width and small depth
- Improved layout of the odd-even sorting network
This page was built for publication: Optimal-depth sorting networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340576)
