Joint Size and Depth Optimization of Sorting Networks

06/01/2018
by   José A. R. Fonollosa, et al.
0

Sorting networks are oblivious sorting algorithms with many interesting theoretical properties and practical applications. One of the related classical challenges is the search of optimal networks respect to size (number of comparators) of depth (number of layers). However, up to our knowledge, the joint size-depth optimality of small sorting networks has not been addressed before. This paper presents size-depth optimality results for networks up to 12 channels. Our results show that there are sorting networks for n≤9 inputs that are optimal in both size and depth, but this is not the case for 10 and 12 channels. For n=10 inputs, we were able to proof that optimal-depth optimal sorting networks with 7 layers require 31 comparators while optimal-size networks with 29 comparators need 8 layers. For n=11 inputs we show that networks with 8 or 9 layers require at least 35 comparators (the best known upper bound for the minimal size). And for networks with n=12 inputs and 8 layers we need 40 comparators, while for 9 layers the best known size is 39.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

07/14/2018

SAT encodings for sorting networks, single-exception sorting networks and ε-halvers

Sorting networks are oblivious sorting algorithms with many practical ap...
10/26/2018

Some comments on the structure of the best known networks sorting 16 elements

We propose an explanation of the structure of the best known sorting net...
12/08/2020

An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels

We show that 11-channel sorting networks have at least 35 comparators an...
11/01/2019

Optimal Metastability-Containing Sorting via Parallel Prefix Computation

Friedrichs et al. (TC 2018) showed that metastability can be contained w...
01/22/2018

Optimal Metastability-Containing Sorting Networks

When setup/hold times of bistable elements are violated, they may become...
08/21/2019

Engineering Faster Sorters for Small Sets of Items

Sorting a set of items is a task that can be useful by itself or as a bu...
08/22/2020

On the Size of Minimal Separators for Treedepth Decomposition

Treedepth decomposition has several practical applications and can be us...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.