Parallel sorting - The need for speed

Abstract

This chapter presents a parallel sorting algorithm. By parallel we mean that many comparisons can be done concurrently so that we need much less time than with an algorithm in which the comparisons have to be done one after the other. Parallel algorithms are particularly interesting for computers with many processors or a processor with many cores that can work concurrently, or for the design of chips or machines dedicated for sorting. © 2011 Springer-Verlag Berlin Heidelberg.