Memory-Efficient sierpinski-order traversals on dynamically adaptive, recursively structured triangular grids

Authors:
Michael Bader;Kaveh Rahnema;Csaba Vigh
Affiliations:
Institute of Parallel and Distributed Systems, Universität Stuttgart, Germany;Institute of Parallel and Distributed Systems, Universität Stuttgart, Germany;Department of Informatics, Technische Universität München, Germany
Venue:
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
Year:
2010

Citing 9
Cited 1

The input/output complexity of sorting and related problems

Communications of the ACM
Time/space tradeoffs for polygon mesh rendering

ACM Transactions on Graphics (TOG)
Large scale terrain visualization using the restricted quadtree triangulation

Proceedings of the conference on Visualization '98
Optimization of mesh locality for transparent vertex caching

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Multiresolution Compression and Visualization of Global Topographic Data

Geoinformatica
Cache oblivious stencil computations

Proceedings of the 19th annual international conference on Supercomputing
A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids

Journal of Parallel and Distributed Computing
Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves

International Journal of Computational Science and Engineering
Dynamically Adaptive Simulations with Minimal Memory Requirement—Solving the Shallow Water Equations Using Sierpinski Curves

SIAM Journal on Scientific Computing

Cluster optimization and parallelization of simulations with dynamically adaptive grids

Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adaptive mesh refinement and iterative traversals of unknowns on such adaptive grids are fundamental building blocks for PDE solvers. We discuss a respective integrated approach for grid refinement and processing of unknowns that is based on recursively structured triangular grids and space-filling element orders. In earlier work, the approach was demonstrated to be highly memory- and cache-efficient. In this paper, we analyse the cache efficiency of the traversal algorithms using the I/O model. Further, we discuss how the nested recursive traversal algorithms can be efficiently implemented. For that purpose, we compare the memory throughput of respective implementations with simple stream benchmarks, and study the dependence of memory throughput and floating point performance from the computational load per element.