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...

Celý popis

Podrobná bibliografia

Vydané v:	2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing s. 359 - 366
Hlavní autori:	Codish, Michael, Cruz-Filipe, Luis, Schneider-Kamp, Peter
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.09.2014
Predmet:	Computer science Educational institutions Joining processes Runtime Sorting Syntactics
ISBN:	9781479984473, 1479984477
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!