Keller, JörgKessler, ChristophKönig, KalleHeenes, WolfgangNagel, Wolfgang E.Hoffmann, RolfKoch, Andreas2019-05-062019-05-062008978-3-88579-218-5https://dl.gi.de/handle/20.500.12116/22269Sorting large data sets has always been an important application, and hence has been one of the benchmark applications on new parallel architectures. We present a parallel sorting algorithm for the Cell processor that combines elements of bitonic sort and merge sort, and reduces the bandwidth to main memory by pipelining. We present runtime results of a partial prototype implementation and simulation results for the complete sorting algorithm, that promise performance advantages over previ- ous implementations.enParallel SortMerge SortCell ProcessorHybrid SortText/Conference Paper1617-5468