Constant-Depth Sorting Networks

In this paper, we address sorting networks that are constructed from comparators of arity k > 2. That is, in our setting the arity of the comparators – or, in other words, the number of inputs that can be sorted at the unit cost – is a parameter. We study its relationship with two other parameters – n, the number of inputs, and d, the depth. This model received considerable attention. Partly, its motivation is to better understand the structure of sorting networks. In particular, sorting networks with large arity are related to recursive constructions of ordinary sorting networks. Additionally, studies of this model have natural correspondence with a recent line of work on constructing circuits for majority functions from majority gates of lower fan-in. Motivated by these questions, we obtain the first lower bounds on the arity of constant-depth sorting networks. More precisely, we consider sorting networks of depth d up to 4, and determine the minimal k for which there is such a network with comparators of arity k. For depths d=1,2 we observe that k=n. For d=3 we show that k = ⌈n/2⌉. For d=4 the minimal arity becomes sublinear: k = Θ(n^2/3). This contrasts with the case of majority circuits, in which k = O(n^2/3) is achievable already for depth d=3.

READ FULL TEXT

page 1

page 3

page 5

page 11

page 17

research
06/01/2018

Joint Size and Depth Optimization of Sorting Networks

Sorting networks are oblivious sorting algorithms with many interesting ...
research
07/14/2018

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

Sorting networks are oblivious sorting algorithms with many practical ap...
research
11/01/2019

Optimal Metastability-Containing Sorting via Parallel Prefix Computation

Friedrichs et al. (TC 2018) showed that metastability can be contained w...
research
02/19/2021

Sorting Short Integers

We build boolean circuits of size O(nm^2) and depth O(log(n) + m log(m))...
research
09/22/2017

Quantified Derandomization of Linear Threshold Circuits

One of the prominent current challenges in complexity theory is the atte...
research
02/18/2020

Multiparty Karchmer-Wigderson Games and Threshold Circuits

We suggest a generalization of Karchmer-Wigderson communication games to...
research
01/22/2018

Optimal Metastability-Containing Sorting Networks

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

Please sign up or login with your details

Forgot password? Click here to reset