Name
Abstract | ||
|---|---|---|
•We introduce two algorithms to hold particles in dynamically adaptive grids.•Particles are associated to the nearest cell or vertex though they may tunnel.•A PIC code validates that particle-grid interactions can be realised efficiently.•Measurements reveal which variant performs better for certain setups and hardware.•A data movement prediction scheme avoids all-to-all communication partially. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.parco.2015.12.007 | Parallel Computing |
Keywords | Field | DocType |
Particle-in-cell,Spacetree,Particle sorting,AMR,Lagrangian–Eulerian methods,Communication-avoiding | Lift (force),Dispersion relation,Vertex (geometry),Computer science,A priori and a posteriori,Parallel computing,Algorithm,Theoretical computer science,Grid,Particle,Cartesian coordinate system,Scalability | Journal |
Volume | Issue | ISSN |
52 | C | 0167-8191 |
Citations | PageRank | References |
2 | 0.39 | 17 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tobias Weinzierl | 1 | 115 | 17.36 |
| B. Verleye | 2 | 2 | 0.39 |
| Pierre Henri | 3 | 2 | 0.39 |
| Dirk Roose | 4 | 545 | 159.25 |