Space-Filling Curves Continued: Sierpinski

A new massive-splitting parallelization concept using Sierpinski space-filling curves with dynamic adaptive mesh refinement is presented. We developed a new parallel software concept (independent storage of partitions) for shared-memory systems using a run-length encoded communication and several other beneficial advantages.<br><br>Related work:<br>* Jörn Behrens and Jens Zimmermann, Parallelizing an unstructured grid generator with a space-filling curve approach, in Euro-Par 2000 Parallel Processing<br>* Frank Günther, Miriam Mehl, Markus Pögl, and Christoph Zenger, A cache-aware algorithm for PDEs on hierarchical data structures based on space-filling curves, SIAM Journal on Scientific Computing, 28 (2006)<br>* Michael Bader, Kaveh Rahnema, and Csaba Attila Vigh, Memory-efficient sierpinski-order traversals on dynamically adaptive, recursively structured triangular grids, in Applied Parallel and Scientific Computing<br>* Hans Sagan, Space-filling curves, vol. 18, Springer-Verlag New York, 1994 * David L George, Augmented riemann solvers for the shallow water equations over variable topography with steady states and inundation, Journal of Computational Physics