Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen:
http://dx.doi.org/10.18419/opus-11188
Langanzeige der Metadaten
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Fischer, Alexander | - |
dc.date.accessioned | 2020-12-14T15:40:30Z | - |
dc.date.available | 2020-12-14T15:40:30Z | - |
dc.date.issued | 2020 | de |
dc.identifier.other | 174348268X | - |
dc.identifier.uri | http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-112059 | de |
dc.identifier.uri | http://elib.uni-stuttgart.de/handle/11682/11205 | - |
dc.identifier.uri | http://dx.doi.org/10.18419/opus-11188 | - |
dc.description.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. | en |
dc.language.iso | en | de |
dc.rights | info:eu-repo/semantics/openAccess | de |
dc.subject.ddc | 004 | de |
dc.title | Experimental study of the AKS sorting network | en |
dc.type | bachelorThesis | de |
ubs.fakultaet | Informatik, Elektrotechnik und Informationstechnik | de |
ubs.institut | Institut für Formale Methoden der Informatik | de |
ubs.publikation.seiten | 33 | de |
ubs.publikation.typ | Abschlussarbeit (Bachelor) | de |
Enthalten in den Sammlungen: | 05 Fakultät Informatik, Elektrotechnik und Informationstechnik |
Dateien zu dieser Ressource:
Datei | Beschreibung | Größe | Format | |
---|---|---|---|---|
thesis.pdf | 586,14 kB | Adobe PDF | Öffnen/Anzeigen |
Alle Ressourcen in diesem Repositorium sind urheberrechtlich geschützt.