% IMPORTANT: The following is UTF-8 encoded. This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.
@MASTERSTHESIS{Hofmann:50940,
author = {Hofmann, Michael},
title = {{P}aralleles {S}ortieren am {B}eispiel der schnellen
{M}ultipolmethode},
volume = {4211},
issn = {0944-2952},
school = {Techn. Univ. Chemnitz},
type = {Diplom (Univ.)},
address = {Jülich},
publisher = {Foschungszentrum Jülich Jülich GmbH Zentralbibliothek,
Verlag},
reportid = {PreJuSER-50940, Juel-4211},
series = {Berichte des Forschungszentrums Jülich},
pages = {76 p.},
year = {2006},
note = {Record converted from VDB: 12.11.2012; Chemnitz, Techn.
Univ., Dipl., 2005},
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.},
cin = {ZAM},
cid = {I:(DE-Juel1)VDB62},
pnm = {Scientific Computing},
pid = {G:(DE-Juel1)FUEK411},
typ = {PUB:(DE-HGF)10},
url = {https://juser.fz-juelich.de/record/50940},
}