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
N1 - Funding Information:
This work was supported by the Israel Science Foundation , grant 182/13 , by the Danish Council for Independent Research Natural Sciences , the German Federal Ministry of Education and Research , combined project 01IH15006A , and by a fellowship within the FITweltweit programme of the German Academic Exchange Service (DAAD). The necessary computational resources were provided by an IBM Shared University Award ( Ben-Gurion University ) and the Dependable Systems Group, University of Kiel.
Funding Information:
This work was supported by the Israel Science Foundation, grant 182/13, by the Danish Council for Independent Research Natural Sciences, the German Federal Ministry of Education and Research, combined project 01IH15006A, and by a fellowship within the FITweltweit programme of the German Academic Exchange Service (DAAD). The necessary computational resources were provided by an IBM Shared University Award (Ben-Gurion University) and the Dependable Systems Group, University of Kiel.
Publisher Copyright:
© 2016 Elsevier Inc.
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 -