Learn More
—In this work we present an approach for the paral-lelization of hyperbolic simulations on shared-memory architec-tures running on fully-adaptive grids. We tackle the parallelization problem with a dynamic sub-tree split-and join-approach by running computations on those split sub-trees in parallel using lightweight tasks. The traversal of sub-trees created(More)
The present paper studies solvers for partial differential equations that work on dynamically adaptive grids stemming from spacetrees. Due to the underlying tree formalism, such grids efficiently can be decomposed into connected grid regions (clusters) on-the-fly. A graph on those clusters classified according to their grid invariancy, workload, multi-core(More)
High performance computing with thousands of cores relies on distributed memory due to memory consistency reasons. The resource management on such systems usually relies on static assignment of resources at the start of each application. Such a static scheduling is incapable of starting applications with required resources being used by others since a(More)
—With steadily increasing parallelism for high-performance architectures, simulations requiring a good strong scalability are prone to be limited in scalability with standard spatial-decomposition strategies at a certain amount of parallel processors. This can be a show-stopper if the simulation results have to be computed with wallclock time restrictions(More)