Parallel Sorting - The Need for Speed

Wanka R (2011)

Publication Language: English

Publication Type: Book chapter / Article in edited volumes

Publication year: 2011

Publisher: Springer

Edited Volumes: Algorithms Unplugged

City/Town: Heidelberg

Pages Range: 27-37

ISBN: 978-3-642-15327-3

DOI: 10.1007/978-3-642-15328-0_4

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.

Authors with CRIS profile

Rolf Wanka 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: Download