Zachmann, GabrielGabrielZachmann2023-08-022023-08-022011978-0-387-09766-4https://media.suub.uni-bremen.de/handle/elib/7043https://doi.org/10.26092/elib/2364Adaptive bitonic sorting is a sorting algorithm suitable for implementation on EREW parallel architectures. Similar to bitonic sorting, it is based on merging, which is recursively applied to obtain a sorted sequence. In contrast to bitonic sorting, it is data dependent. Adaptive bitonic merging can be performed in O(n/p) parallel time, p being the number of processors, and executes only O(n) operations in total. Consequently, adaptive bitonic sorting can be performed in O(n log n/p) time, which is optimal. So, one of its advantages is that it executes a factor of O(log n) less operations than bitonic sorting. Another advantage is that it can be implemented efficiently on modern GPUs.enAlle Rechte vorbehaltenAlle Rechte vorbehaltensorting algorithmbitonic sorting000 Informatik, Informationswissenschaft, allgemeine WerkeText::Zeitschrift::Wissenschaftlicher Artikel10.26092/elib/2364urn:nbn:de:gbv:46-elib70439