Library support for parallel sorting in scientific computations

Authors:
Holger Dachsel;Michael Hofmann;Gudula Rünger
Affiliations:
John von Neumann Institute for Computing, Central Institute for Applied Mathematics, Research Centre Jülich, Germany;Department of Computer Science, Chemnitz University of Technology, Germany;Department of Computer Science, Chemnitz University of Technology, Germany
Venue:
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Year:
2007

Citing 10
Cited 2

A fast algorithm for particle simulations

Journal of Computational Physics
Practical in-place merging

Communications of the ACM
An Efficient General In-Place Parallel Sorting Scheme

The Journal of Supercomputing
A data-parallel implementation of O(N) hierarchical N-body methods

Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Fast parallel in-memory 64-bit sorting

ICS '01 Proceedings of the 15th international conference on Supercomputing
S-HARP: a scalable parallel dynamic partitioner for adaptive mesh-based computations

SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Parallel Sorting Algorithms

Parallel Sorting Algorithms
Partitioned parallel radix sort

Journal of Parallel and Distributed Computing
Zoltan Data Management Service for Parallel Dynamic Applications

Computing in Science and Engineering
An overview of the BlueGene/L Supercomputer

Proceedings of the 2002 ACM/IEEE conference on Supercomputing

Fine-Grained Data Distribution Operations for Particle Codes

Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Dynamic load balancing of Lattice Boltzmann free-surface fluid animations

Proceedings of the 7th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sorting is an integral part of numerous algorithms and, therefore, efficient sorting support is needed by many applications. This paper presents a parallel sorting library providing efficient implementations of parallel sorting methods that can be easily adapted to a specific application. A parallel implementation of the Fast Multipole Method is used to demonstrate the configuration and the usage of the library. We also describe a parallel sorting method which provides the ability to adapt to the actual amount of memory available. Performance results for a BlueGene/L supercomputer are given.