Hybrid Parallel Sort on the Cell Processor

Zusammenfassung
Sorting 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.
  • Vollständige Referenz
  • BibTeX
Keller, J., Kessler, C., König, K. & Heenes, W., (2008). Hybrid Parallel Sort on the Cell Processor. In: Nagel, W. E., Hoffmann, R. & Koch, A. (Hrsg.), 9th workshop on parallel systems and algorithms – workshop of the GI/ITG special interest groups PARS and PARVA. Bonn: Gesellschaft für Informatik e. V.. (S. 107-112).
@inproceedings{mci/Keller2008,
author = {Keller, Jörg AND Kessler, Christoph AND König, Kalle AND Heenes, Wolfgang},
title = {Hybrid Parallel Sort on the Cell Processor},
booktitle = {9th workshop on parallel systems and algorithms – workshop of the GI/ITG special interest groups PARS and PARVA},
year = {2008},
editor = {Nagel, Wolfgang E. AND Hoffmann, Rolf AND Koch, Andreas} ,
pages = { 107-112 },
publisher = {Gesellschaft für Informatik e. V.},
address = {Bonn}
}
DateienGroesseFormatAnzeige
107.pdf153.4Kb PDF Öffnen

Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Feedback abschicken

Mehr Information

ISBN: 978-3-88579-218-5
ISSN: 1617-5468
Datum: 2008
Sprache: en (en)
Typ: Text/Conference Paper
Sammlungen

Zur Langanzeige