New Bounds on Optimal Sorting Networks

We present new parallel sorting networks for \(17\) to \(20\) inputs. For \(17, 19,\) and \(20\) inputs these new networks are faster (i.e., they require fewer computation steps) than the previously known best networks. Therefore, we improve upon the known upper bounds for minimal depth sorting networks on \(17, 19,\) and \(20\) channels. Furthermore, we show that our sorting network for \(17\) inputs is optimal in the sense that no sorting network using less layers exists. This solves the main open problem of [D. Bundala & J. Zavodný. Optimal sorting networks, Proc. LATA 2014].

[1]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[2]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[3]  Drue Coles.  Efficient filters for the simulated evolution of small sorting networks , 2012, GECCO '12.

[4]  Inês Lynce,et al.  Probing-based preprocessing techniques for propositional satisfiability , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.

[5]  Kenneth E. Batcher,et al.  An 11-Step Sorting Network for 18 Elements , 2009, Parallel Process. Lett..

[6]  Risto Miikkulainen,et al.  Using symmetry and evolutionary search to minimize sorting networks , 2013, J. Mach. Learn. Res..

[7]  Kenneth E. Batcher,et al.  A 12-STEP SORTING NETWORK FOR 22 ELEMENTS , 2008 .

[8]  Ian Parberry.  A computer-assisted optimal depth lower bound for nine-input sorting networks , 2005, Mathematical systems theory.

[9]  Jakub Závodný,et al.  Optimal Sorting Networks , 2013, LATA.

[10]  Peter Schneider-Kamp,et al.  Sorting Networks: the End Game , 2014, LATA.

[11]  Peter Schneider-Kamp,et al.  The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes , 2014, 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.