Memory-Efficient Sierpinski-Order Traversals on Dynamically Adaptive, Recursively Structured Triangular Grids

  • Michael Bader
  • Kaveh Rahnema
  • Csaba Vigh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7134)

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.

Keywords

adaptive mesh refinement cache oblivious algorithms space-filling curves memory-bound performance partial differential equations 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aggarwal, A., Vitter, J.: The input/output complexity of sorting and related problems. Commun. ACM 31, 1116–1127 (1988)MathSciNetCrossRefGoogle Scholar
  2. 2.
    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)CrossRefMATHGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Bar-Yehuda, R., Gotsman, C.: Time/space tradeoffs for polygon mesh rendering. ACM Transactions on Graphics 15(2), 141–152 (1996)CrossRefGoogle Scholar
  5. 5.
    Bogomjakov, A., Gotsman, C.: Universal rendering sequences for transparent vertex caching of progressive meshes. Comput. Graphics Forum 21(2), 137–148 (2002)CrossRefGoogle Scholar
  6. 6.
    Bungartz, H., Mehl, M., Neckel, T., Weinzierl, T.: The PDE framework Peano applied to fluid dynamics. Comput. Mech. 46(1) (2010)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Gerstner, T.: Multiresolution Compression and Visualization of Global Topographic Data. GeoInformatica 7(1), 7–32 (2003)MathSciNetCrossRefGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Lindstrom, P., Pascucci, V.: Terrain simplification simplified: A general framework for view-dependent out-of-core visualization. Technical Report UCRL-JC-147847 (2002)Google Scholar
  11. 11.
    Mehl, M., Weinzierl, T., Zenger, C.: A cache-oblivious self-adaptive full multigrid method. Numer. Lin. Alg. Appl. 13(2-3), 275–291 (2006)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    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)CrossRefMATHGoogle Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Zumbusch, G.: On the quality of space-filling curve induced partitions. Z. Angew. Math. Mech. 81(suppl. 10), 25–28 (2001)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Michael Bader
    • 1
  • Kaveh Rahnema
    • 1
  • Csaba Vigh
    • 2
  1. 1.Institute of Parallel and Distributed SystemsUniversität StuttgartGermany
  2. 2.Department of InformaticsTechnische Universität MünchenGermany

Personalised recommendations