Sorting networks: To the end and back again

Michael Codish; Luís Cruz-Filipe; Thorsten Ehlers; Mike Müller; Peter Schneider-Kamp

doi:10.1016/j.jcss.2016.04.004

Sorting networks: To the end and back again

Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

Abstract

New properties of the front and back ends of sorting networks are studied, illustrating their utility when searching for bounds on optimal networks. Search focuses first on the “out-sides” of the network and then on the inner part. Previous works focused on properties of the front end to break symmetries in the search. The new, out-side-in, properties shed understanding on how sorting networks sort, and facilitate the computation of new bounds on optimality. We present new, faster, parallel sorting networks for 17–20 inputs. For 17 inputs, we show that no sorting network using less layers exists.

Original language	English
Pages (from-to)	184-201
Number of pages	18
Journal	Journal of Computer and System Sciences
Volume	104
DOIs	https://doi.org/10.1016/j.jcss.2016.04.004
State	Published - 1 Sep 2019

Keywords

SAT-solving
Sorting networks

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science
Computer Networks and Communications
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1016/j.jcss.2016.04.004

Cite this

@article{4285b6da8b714434b87414df14e8c524,

title = "Sorting networks: To the end and back again",

abstract = "New properties of the front and back ends of sorting networks are studied, illustrating their utility when searching for bounds on optimal networks. Search focuses first on the “out-sides” of the network and then on the inner part. Previous works focused on properties of the front end to break symmetries in the search. The new, out-side-in, properties shed understanding on how sorting networks sort, and facilitate the computation of new bounds on optimality. We present new, faster, parallel sorting networks for 17–20 inputs. For 17 inputs, we show that no sorting network using less layers exists.",

keywords = "SAT-solving, Sorting networks",

author = "Michael Codish and Lu{\'i}s Cruz-Filipe and Thorsten Ehlers and Mike M{\"u}ller and Peter Schneider-Kamp",

note = "Publisher Copyright: {\textcopyright} 2016 Elsevier Inc.",

year = "2019",

month = sep,

day = "1",

doi = "10.1016/j.jcss.2016.04.004",

language = "English",

volume = "104",

pages = "184--201",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Sorting networks

T2 - To the end and back again

AU - Codish, Michael

AU - Cruz-Filipe, Luís

AU - Ehlers, Thorsten

AU - Müller, Mike

AU - Schneider-Kamp, Peter

PY - 2019/9/1

Y1 - 2019/9/1

N2 - New properties of the front and back ends of sorting networks are studied, illustrating their utility when searching for bounds on optimal networks. Search focuses first on the “out-sides” of the network and then on the inner part. Previous works focused on properties of the front end to break symmetries in the search. The new, out-side-in, properties shed understanding on how sorting networks sort, and facilitate the computation of new bounds on optimality. We present new, faster, parallel sorting networks for 17–20 inputs. For 17 inputs, we show that no sorting network using less layers exists.

AB - New properties of the front and back ends of sorting networks are studied, illustrating their utility when searching for bounds on optimal networks. Search focuses first on the “out-sides” of the network and then on the inner part. Previous works focused on properties of the front end to break symmetries in the search. The new, out-side-in, properties shed understanding on how sorting networks sort, and facilitate the computation of new bounds on optimality. We present new, faster, parallel sorting networks for 17–20 inputs. For 17 inputs, we show that no sorting network using less layers exists.

KW - SAT-solving

KW - Sorting networks

UR - http://www.scopus.com/inward/record.url?scp=85058722595&partnerID=8YFLogxK

U2 - 10.1016/j.jcss.2016.04.004

DO - 10.1016/j.jcss.2016.04.004

M3 - Article

AN - SCOPUS:85058722595

SN - 0022-0000

VL - 104

SP - 184

EP - 201

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

ER -

Sorting networks: To the end and back again

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this