guest ::
| Home > Publications database > Paralleles Sortieren am Beispiel der schnellen Multipolmethode > print |
| Home > Publications database > Paralleles Sortieren am Beispiel der schnellen Multipolmethode > print |
| 001 | 50940 | ||
| 005 | 20200610184814.0 | ||
| 024 | 7 | _ | |2 Handle |a 2128/484 |
| 024 | 7 | _ | |2 URI |a 484 |
| 037 | _ | _ | |a PreJuSER-50940 |
| 088 | 1 | _ | |a Juel-4211 |
| 088 | _ | _ | |a Juel-4211 |2 JUEL |
| 100 | 1 | _ | |0 P:(DE-Juel1)VDB7007 |a Hofmann, Michael |b 0 |e Corresponding author |u FZJ |
| 245 | _ | _ | |a Paralleles Sortieren am Beispiel der schnellen Multipolmethode |
| 260 | _ | _ | |a Jülich |b Foschungszentrum Jülich Jülich GmbH Zentralbibliothek, Verlag |c 2006 |
| 300 | _ | _ | |a 76 p. |
| 336 | 7 | _ | |0 PUB:(DE-HGF)10 |2 PUB:(DE-HGF) |a Diploma Thesis |
| 336 | 7 | _ | |0 2 |2 EndNote |a Thesis |
| 336 | 7 | _ | |2 DataCite |a Output Types/Supervised Student Publication |
| 336 | 7 | _ | |2 DRIVER |a masterThesis |
| 336 | 7 | _ | |2 ORCID |a SUPERVISED_STUDENT_PUBLICATION |
| 336 | 7 | _ | |2 BibTeX |a MASTERSTHESIS |
| 490 | 0 | _ | |0 PERI:(DE-600)2414853-2 |8 24014 |a Berichte des Forschungszentrums Jülich |v 4211 |x 0944-2952 |
| 500 | _ | _ | |a Record converted from VDB: 12.11.2012 |
| 502 | _ | _ | |a Chemnitz, Techn. Univ., Dipl., 2005 |b Diplom (Univ.) |c Techn. Univ. Chemnitz |d 2005 |
| 520 | _ | _ | |a 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. |
| 536 | _ | _ | |0 G:(DE-Juel1)FUEK411 |2 G:(DE-HGF) |a Scientific Computing |c P41 |x 0 |
| 655 | _ | 7 | |a Hochschulschrift |x Diploma Thesis (Univ.) |
| 856 | 4 | _ | |u https://juser.fz-juelich.de/record/50940/files/Juel_4211_Hoffmann.pdf |y OpenAccess |
| 909 | C | O | |o oai:juser.fz-juelich.de:50940 |p openaire |p open_access |p driver |p VDB |p dnbdelivery |
| 913 | 1 | _ | |0 G:(DE-Juel1)FUEK411 |b Schlüsseltechnologien |k P41 |l Supercomputing |v Scientific Computing |x 0 |
| 914 | 1 | _ | |y 2006 |
| 915 | _ | _ | |0 StatID:(DE-HGF)0510 |2 StatID |a OpenAccess |
| 920 | 1 | _ | |0 I:(DE-Juel1)VDB62 |d 31.12.2007 |g ZAM |k ZAM |l Zentralinstitut für Angewandte Mathematik |x 0 |
| 970 | _ | _ | |a VDB:(DE-Juel1)79806 |
| 980 | _ | _ | |a VDB |
| 980 | _ | _ | |a JUWEL |
| 980 | _ | _ | |a ConvertedRecord |
| 980 | _ | _ | |a diploma |
| 980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| 980 | _ | _ | |a UNRESTRICTED |
| 980 | _ | _ | |a FullTexts |
| 980 | 1 | _ | |a FullTexts |
| 981 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|