Optimal-depth sorting networks
From MaRDI portal
Publication:340576
DOI10.1016/J.JCSS.2016.09.004zbMATH Open1353.68062arXiv1412.5302OpenAlexW1726079515MaRDI QIDQ340576FDOQ340576
Authors: Daniel Bundala, Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp, Jakub Závodný 
Publication date: 14 November 2016
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1412.5302
Recommendations
Cites Work
- Practical graph isomorphism. II.
- Compiling finite domain constraints to SAT with BEE
- Title not available (Why is that?)
- 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
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- Sorting networks: to the end and back again
- Sorting networks: the end game
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- New Bounds on Optimal Sorting Networks
- A computer-assisted optimal depth lower bound for nine-input sorting networks
- Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
- Optimal sorting networks
- Title not available (Why is that?)
- Applying sorting networks to synthesize optimized sorting libraries
- Computer-aided proof of Erdős discrepancy properties
- Sorting nine inputs requires twenty-five comparisons
- Bounds on the size of test sets for sorting and related networks
Cited In (19)
- Sorting with Complete Networks of Stacks
- Bitonic sorters of minimal depth
- Sorting networks: to the end and back again
- Improved layout of the odd-even sorting network
- Sorting-based selection algorithms for hypercubic networks
- Title not available (Why is that?)
- Sorting and counting networks of arbitrary width and small depth
- New Bounds on Optimal Sorting Networks
- A computer-assisted optimal depth lower bound for nine-input sorting networks
- The half cleaner lemma: constructing efficient interconnection networks from sorting networks
- Improved sorting networks with O(log N) depth
- Practical algorithms for finding extremal sets
- A lower bound for sorting networks based on the shuffle permutation
- Formalizing size-optimal sorting networks: extracting a certified proof checker
- Sorting nine inputs requires twenty-five comparisons
- Optimizing sorting algorithms by using sorting networks
- Formally proving size optimality of sorting networks
- Optimal sorting networks
- Sorting networks: the end game
Uses Software
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)
