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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, A., Vitter, J.: The input/output complexity of sorting and related problems. Commun. ACM 31, 1116–1127 (1988)
Bader, M., Böck, C., Schwaiger, J., Vigh, C.: Dynamically adaptive simulations with minimal memory requirement – solving the shallow water equations using Sierpinksi curves. SIAM J. Sci. Comput. 32(1), 212–228 (2010)
Bader, M., Schraufstetter, S., Vigh, C., Behrens, J.: Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves. Int. J. Comput. Sci. Eng. 4(1), 12–21 (2008)
Bar-Yehuda, R., Gotsman, C.: Time/space tradeoffs for polygon mesh rendering. ACM Transactions on Graphics 15(2), 141–152 (1996)
Bogomjakov, A., Gotsman, C.: Universal rendering sequences for transparent vertex caching of progressive meshes. Comput. Graphics Forum 21(2), 137–148 (2002)
Bungartz, H., Mehl, M., Neckel, T., Weinzierl, T.: The PDE framework Peano applied to fluid dynamics. Comput. Mech. 46(1) (2010)
Frigo, M., Strumpen, V.: Cache oblivious stencil computations. In: ICS 2005: Proc. of the 19th Annual International Conference on Supercomputing, pp. 361–366. ACM (2005)
Gerstner, T.: Multiresolution Compression and Visualization of Global Topographic Data. GeoInformatica 7(1), 7–32 (2003)
Hoppe, H.: Optimization of mesh locality for transparent vertex caching. In: SIGGRAPH 1999: Proc. of the 26th Annual Conf. on Computer Graphics and Interactive Techniques, pp. 269–276 (1999)
Lindstrom, P., Pascucci, V.: Terrain simplification simplified: A general framework for view-dependent out-of-core visualization. Technical Report UCRL-JC-147847 (2002)
Mehl, M., Weinzierl, T., Zenger, C.: A cache-oblivious self-adaptive full multigrid method. Numer. Lin. Alg. Appl. 13(2-3), 275–291 (2006)
Mitchell, W.: A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids. J. Parallel Distrib. Comput. 67(4), 417–429 (2007)
Pajarola, R.: Large scale terrain visualization using the restricted quadtree triangulation. In: VIS 1998: Proc. of the Conf. on Visualization 1998, pp. 19–26. IEEE Computer Society Press (1998)
Zumbusch, G.: On the quality of space-filling curve induced partitions. Z. Angew. Math. Mech. 81(suppl. 10), 25–28 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bader, M., Rahnema, K., Vigh, C. (2012). Memory-Efficient Sierpinski-Order Traversals on Dynamically Adaptive, Recursively Structured Triangular Grids. In: Jónasson, K. (eds) Applied Parallel and Scientific Computing. PARA 2010. Lecture Notes in Computer Science, vol 7134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28145-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-28145-7_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28144-0
Online ISBN: 978-3-642-28145-7
eBook Packages: Computer ScienceComputer Science (R0)