The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes

Previous work identifying depth-optimal n-channel sorting networks for 9 ≤ n ≤ 16 is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper revisits the problem of generating two-layer prefixes modulo symmetr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing S. 359 - 366
Hauptverfasser: Codish, Michael, Cruz-Filipe, Luis, Schneider-Kamp, Peter
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.09.2014
Schlagworte:
Computer science
Educational institutions
Joining processes
Runtime
Sorting
Syntactics
ISBN:9781479984473, 1479984477
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Previous work identifying depth-optimal n-channel sorting networks for 9 ≤ n ≤ 16 is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper revisits the problem of generating two-layer prefixes modulo symmetries. An improved notion of symmetry is provided and a novel technique based on regular languages and graph isomorphism is shown to generate the set of non-symmetric representations. An empirical evaluation demonstrates that the new method outperforms the generate-and-test approach by orders of magnitude and easily scales until n = 40.
AbstractList Previous work identifying depth-optimal n-channel sorting networks for 9 ≤ n ≤ 16 is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper revisits the problem of generating two-layer prefixes modulo symmetries. An improved notion of symmetry is provided and a novel technique based on regular languages and graph isomorphism is shown to generate the set of non-symmetric representations. An empirical evaluation demonstrates that the new method outperforms the generate-and-test approach by orders of magnitude and easily scales until n = 40.
Author Schneider-Kamp, Peter
Codish, Michael
Cruz-Filipe, Luis
Author_xml – sequence: 1
  givenname: Michael
  surname: Codish
  fullname: Codish, Michael
  organization: Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
– sequence: 2
  givenname: Luis
  surname: Cruz-Filipe
  fullname: Cruz-Filipe, Luis
  organization: Dept. of Math. & Comput. Sci., Univ. of Southern Denmark, Odense, Denmark
– sequence: 3
  givenname: Peter
  surname: Schneider-Kamp
  fullname: Schneider-Kamp, Peter
  organization: Dept. of Math. & Comput. Sci., Univ. of Southern Denmark, Odense, Denmark
BookMark eNpVjkFPwyAYQDFqos5evXjhD7QChQLelmVOk2ZTWw-eFtp-KHHCQjFz_94levH08i4v7wKd-OABoStKCkqJvmlel9NmVjBCeSHEEcq0VJRLrRXnihz_c1meoWwcXUdYJStesuocPbfvgJ--YEzYhohX2-Q-zQY3ISbn3_AS0i7Ej_EWz611vQOf8AI8RJNc8DhY3O5CXps9RPwYwbpvGC_RqTWbEbI_TtDL3byd3ef1avEwm9a5o1KkXHakqixXlFGgFPrekq7qGEirKBxeuZJMMW6sEJp3RAxaQ6-5tAMlnR1MOUHXv10HAOttPIzH_VqSkksiyh9aLlLn
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SYNASC.2014.55
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781479984480
1479984485
EndPage 366
ExternalDocumentID 7034705
Genre orig-research
GroupedDBID 6IE
6IL
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i175t-7b066f48121e11eccf0b6b2e7f81e4734872824af5594b05d99ec947fd10bfda3
IEDL.DBID RIE
ISBN 9781479984473
1479984477
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000366596600048&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Jun 26 19:20:46 EDT 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-7b066f48121e11eccf0b6b2e7f81e4734872824af5594b05d99ec947fd10bfda3
PageCount 8
ParticipantIDs ieee_primary_7034705
PublicationCentury 2000
PublicationDate 2014-Sept.
PublicationDateYYYYMMDD 2014-09-01
PublicationDate_xml – month: 09
  year: 2014
  text: 2014-Sept.
PublicationDecade 2010
PublicationTitle 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
PublicationTitleAbbrev SYNASC
PublicationYear 2014
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib026764326
Score 1.6294271
Snippet Previous work identifying depth-optimal n-channel sorting networks for 9 ≤ n ≤ 16 is based on exploiting symmetries of the first two layers. However, the naive...
SourceID ieee
SourceType Publisher
StartPage 359
SubjectTerms Computer science
Educational institutions
Joining processes
Runtime
Sorting
Syntactics
Title The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes
URI https://ieeexplore.ieee.org/document/7034705
WOSCitedRecordID wos000366596600048&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELVKxcBUoEV8ywMjaZ3EiWM2VLViqEJFi1SmKo7PqBI0VT-An8_ZSQsDC1sSRXLku_je2ffeEXKDkFWEQZh7fgQME5QYPJko7RnJdBKaKEhy17VkINI0mUzksEZud1wYAHDFZ9C2l-4sXxf5xm6VddA7ubCCpXtCxCVXa-s7QSwwtgax424JzCE4F2Ir6VTdh5Voo89kZ_SS3o-6trSLty3N71drFRdZ-o3_fdMhaf1Q9OhwF3yOSA3mx6Sx7dFAq1-2SZ7QD6jb1aQIT-kjrhDv2RsdFVY94JWmZRX46o72nJYEjkVLJWprMFoYOv4svEGGwByHAzP7glWLPPd74-6DV_VR8GYIDtaeUIgrDMdQ7oPvo80MU7EKQJjEB27lbQQmXjwzmF1wxSItJeSSC6N9pozOwhNSnxdzOCU04MboXBqFSyTnUmeRxldCzWQgcgXsjDTtFE0XpVTGtJqd878fX5ADa4CyZOuS1NfLDVyR_fxjPVstr519vwGtzKM-
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELWqggRTgRbxjQdG0jqJU8dsqGoFIoSKFqlMVRKfUSVoUD-An8_ZSQsDC1sSRXLku_ju7HvvEXKBKavwPT9z3AAYFihtcGSYKkdLpkJfB16YWdWSSMRxOBrJfoVcrrEwAGCbz6BpLu1Zvsqzpdkqa6F3cmEISzeMclaJ1lp5j9cWGF29tkVvCawiOBdiRepU3vslbaPLZGvwHF8POqa5izcN0O-XuIqNLb3a_75qhzR-QHq0vw4_u6QC0z1SW6k00PKnrZNH9ARq9zUpJqj0AdeIt-SVDnLDH_BC46IPfH5Fu5ZNAseiBRe1MRnNNR1-5k6UYGqOw4GefMG8QZ563WHnximVFJwJpgcLR6SYWWiOwdwF10WraZa2Uw-EDl3ghuBGYOnFE431BU9ZoKSETHKhlctSrRJ_n1Sn-RQOCPW41iqTOsVFknOpkkDhK75i0hNZCuyQ1M0Ujd8LsoxxOTtHfz8-J1s3w_toHN3Gd8dk2xijaOA6IdXFbAmnZDP7WEzmszNr629gdKaH
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2014+16th+International+Symposium+on+Symbolic+and+Numeric+Algorithms+for+Scientific+Computing&rft.atitle=The+Quest+for+Optimal+Sorting+Networks%3A+Efficient+Generation+of+Two-Layer+Prefixes&rft.au=Codish%2C+Michael&rft.au=Cruz-Filipe%2C+Luis&rft.au=Schneider-Kamp%2C+Peter&rft.date=2014-09-01&rft.pub=IEEE&rft.isbn=9781479984473&rft.spage=359&rft.epage=366&rft_id=info:doi/10.1109%2FSYNASC.2014.55&rft.externalDocID=7034705
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781479984473/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781479984473/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781479984473/sc.gif&client=summon&freeimage=true