By Topic

Parallel sorting algorithms for optimizing particle simulations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hofmann, M. ; Dept. of Comput. Sci., Chemnitz Univ. of Technol., Chemnitz, Germany ; Runger, G. ; Gibbon, P. ; Speck, R.

Real world particle simulation codes have to handle a huge number of particles and their interactions. Thus, parallel implementations are required to get suitable production codes. Parallel sorting is often used to organize the set of particles or to redistribute data for locality and load balancing concerns. In this article, the use and design of parallel sorting algorithms for parallel particle simulation codes are discussed. As a typical example, the particle simulation code PEPC is considered and a specific parallel sorting algorithm for this application is presented. The resulting parallel simulation code was implemented on an IBM Blue Gene/P system and corresponding performance results are shown.

Published in:

Cluster Computing Workshops and Posters (CLUSTER WORKSHOPS), 2010 IEEE International Conference on

Date of Conference:

20-24 Sept. 2010