Name
Abstract | ||
|---|---|---|
Hierarchical methods like the Barnes-Hut (BH) tree code and the Fast Multipole Method (FMM) are important tools to decrease the algorithmic complexity of solving the N-body problem. We report on recent efforts to achieve massive scalability on IBM Blue Gene/Q and other highly concurrent supercomputers with our BH tree code PEPC by replacing a thread synchronization strategy based on traditional lock data structures with atomic operations. We also describe the integration of the Dual Tree Traversal a more recent algorithm that combines advantages of both BH tree code and FMM into PEPC. We explain how the scalability of this algorithm is influenced by the existing communication scheme and we propose a modification to achieve better distributed memory scalability. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.3233/978-1-61499-621-7-439 | PARALLEL COMPUTING: ON THE ROAD TO EXASCALE |
Keywords | Field | DocType |
N-body problem, hierarchical methods, hybrid parallelism | Tree traversal,Massively parallel,Computer science,Tree (data structure),Parallel computing,Threaded binary tree,Red–black tree,Trie,Fractal tree index,Cartesian tree | Conference |
Volume | ISSN | Citations |
27 | 0927-5452 | 0 |
PageRank | References | Authors |
0.34 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benedikt Steinbusch | 1 | 0 | 0.34 |
| Marvin-Lucas Henkel | 2 | 0 | 0.34 |
| Mathias Winkel | 3 | 23 | 2.12 |
| Paul Gibbon | 4 | 129 | 22.68 |