Parallel Sorting - The Need for Speed

Article in Edited Volumes
(Book chapter)


Publication Details

Author(s): Wanka R
Title edited volumes: Algorithms Unplugged
Publisher: Springer
Publishing place: Heidelberg
Publication year: 2011
Pages range: 27-37
ISBN: 978-3-642-15327-3
Language: English


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.



FAU Authors / FAU Editors

Wanka, Rolf Prof. Dr.
Professur für Informatik (Effiziente Algorithmen und Kombinatorische Optimierung)


How to cite

APA:
Wanka, R. (2011). Parallel Sorting - The Need for Speed. In Algorithms Unplugged. (pp. 27-37). Heidelberg: Springer.

MLA:
Wanka, Rolf. "Parallel Sorting - The Need for Speed." Algorithms Unplugged. Heidelberg: Springer, 2011. 27-37.

BibTeX: 

Last updated on 2019-13-01 at 07:08