Diploma Thesis

PreJuSER-50940

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Paralleles Sortieren am Beispiel der schnellen Multipolmethode

Hofmann, M. (Corresponding author)FZJ*

2006
Foschungszentrum Jülich Jülich GmbH Zentralbibliothek, Verlag Jülich

Please use a persistent id in citations: http://hdl.handle.net/2128/484

Report No.: Juel-4211

Abstract: The fast multipole method (FMM) evaluates Coulomb interactions with linearly scaling computational complexity . A parallel implementation of the FMM (developed at the Central Institute for Applied Mathematics at the Research Centre Jülich) requires linearly scaling methods for parallel sorting. Additional requirements arise due to the usage of the FMM, for example as part of molecular dynamics simulations. They concern the restricted use of memory, the handling of the input data and the preparation of the output data. It is shown, how to achieve sequential and parallel sorting with time $\Omicron$(n) and space $\Omicron$(1) complexity. Finally a library for sorting methods is introduced, to provide flexible and easy to use parallel sorting for applications besides the FMM too.

Note: Record converted from VDB: 12.11.2012
Note: Chemnitz, Techn. Univ., Dipl., 2005

---

Contributing Institute(s):

1. Zentralinstitut für Angewandte Mathematik (ZAM)

Research Program(s):

1. Scientific Computing (P41)

Appears in the scientific report 2006

---

Database coverage:

---