New Bounds on Optimal Sorting Networks

  title={New Bounds on Optimal Sorting Networks},
  author={Thorsten Ehlers and Mike M{\"u}ller},
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 less 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… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…