Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-11188
Authors: Fischer, Alexander
Title: Experimental study of the AKS sorting network
Issue Date: 2020
metadata.ubs.publikation.typ: Abschlussarbeit (Bachelor)
metadata.ubs.publikation.seiten: 33
URI: http://elib.uni-stuttgart.de/handle/11682/11205
http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-112059
http://dx.doi.org/10.18419/opus-11188
Abstract: Sorting networks are usually bound at a depth of O(log^2 n), since a perfect halver is of at least depth O(log n). However, the AKS Sorting Network, by Ajtai, Komlos and Szemeredi, can sort data with depth O(log n) by using so-called ε-halvers, which are of constant depth. Such ε-halvers are allowed to have some errors and will eventually be corrected by sending elements to a level above. In this thesis, a CPU and CUDA version are implemented following a paper by Vasek Chvatal and the original paper by Ajtai et al. Experiments are run on these versions to observe and improve parameters.
Appears in Collections:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Files in This Item:
File Description SizeFormat 
thesis.pdf586,14 kBAdobe PDFView/Open


Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.