liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Optimized Pipelined Parallel Merge Sort on the Cell BE
Dept. of Mathematics and Computer Science FernUniversität in Hagen, Germany.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, PELAB - Programming Environment Laboratory.ORCID iD: 0000-0001-5241-0026
2008 (English)In: 2nd Int. Workshop on Highly Parallel Processing on a Chip HPPC-2008,2008, Berlin: Springer , 2008Conference paper (Refereed)
Abstract [en]

Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to off-chip main memory. As the number of cores is expected to rise further, this bottleneck will become more critical in the coming years. Hence, memory-efficient algorithms are required. As a case study, we investigate parallel sorting on Cell BE as a problem of great importance and as a challenge where the ratio between computation and memory transfer is very low. Our previous work led to a parallel mergesort that reduces memory bandwidth requirements by pipelining between SPEs, but the allocation of SPEs was rather ad-hoc. In our present work, we investigate mappings of merger nodes to SPEs. The mappings are designed to provide optimal trade-offs between load balancing, buffer memory consumption, and communication load on the on-chip bus. We solve this multi-objective optimization problem by deriving an integer linear programming formulation and compute Pareto-optimal solutions for the mapping of merge trees with up to 127 merger nodes. For mapping larger trees, we give a fast divide-and-conquer based approximation algorithm. We evaluate the sorting algorithm resulting from our mappings by a discrete event simulation.

Place, publisher, year, edition, pages
Berlin: Springer , 2008.
Keyword [en]
Parallel computing, multicore processor, computer architecture, algorithm engineering, parallel sorting, integer linear programming
National Category
Computer Science
URN: urn:nbn:se:liu:diva-43703Local ID: 74568OAI: diva2:264563
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2014-10-08

Open Access in DiVA

No full text

Other links

Search in DiVA

By author/editor
Kessler, Christoph
By organisation
The Institute of TechnologyPELAB - Programming Environment Laboratory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 24 hits
ReferencesLink to record
Permanent link

Direct link