TY  - THES
AU  - Hofmann, Michael
TI  - Paralleles Sortieren am Beispiel der schnellen Multipolmethode
VL  - 4211
IS  - Juel-4211
SN  - 0944-2952
PB  - Techn. Univ. Chemnitz
VL  - Diplom (Univ.)
CY  - Jülich
M1  - PreJuSER-50940
M1  - Juel-4211
T2  - Berichte des Forschungszentrums Jülich
SP  - 76 p.
PY  - 2006
N1  - Record converted from VDB: 12.11.2012
N1  - Chemnitz, Techn. Univ., Dipl., 2005
AB  - 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.
LB  - PUB:(DE-HGF)10
UR  - https://juser.fz-juelich.de/record/50940
ER  -