Name
Abstract | ||
|---|---|---|
We explore the potential uses of hash-based algorithms in the remap operation, mapping one computational mesh onto another. We implement and test optimizations designed to reduce memory operations and compare these optimizations in order to evaluate the performance impact across different meshes. In particular, we created a new remap method that creates a structured hierarchy of hashes. Tests were run on 2D meshes on up to 14 levels of mesh refinement and hundreds of millions of cells to measure the algorithms' relative speeds under differing circumstances. We show that our methods perform two orders of magnitude better than the standard kD-tree algorithm and that on different meshes different hash methods can be optimal. We explore these algorithms on serial CPUs, GPUs using OpenCL, and multi-core CPUs using OpenMP. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1137/16M109140X | SIAM JOURNAL ON SCIENTIFIC COMPUTING |
Keywords | Field | DocType |
hashing,remap,algorithms,AMR,parallel,N-body | Mathematical optimization,Parallel computing,Hash function,Mathematics | Journal |
Volume | Issue | ISSN |
40 | 4 | 1064-8275 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gerald Collom | 1 | 0 | 0.34 |
| Colin Redman | 2 | 0 | 0.34 |
| robert robey | 3 | 6 | 1.95 |