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

Michael Bader, Kaveh Rahnema, Csaba Vigh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

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.

Original languageEnglish
Title of host publicationApplied Parallel and Scientific Computing - 10th International Conference, PARA 2010, Revised Selected Papers
Pages302-312
Number of pages11
EditionPART 2
DOIs
StatePublished - 2012
Externally publishedYes
Event10th International Conference on Applied Parallel and Scientific Computing, PARA 2010 - Reykjavik, Iceland
Duration: 6 Jun 20109 Jun 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume7134 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Conference on Applied Parallel and Scientific Computing, PARA 2010
Country/TerritoryIceland
CityReykjavik
Period6/06/109/06/10

Keywords

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

Fingerprint

Dive into the research topics of 'Memory-efficient sierpinski-order traversals on dynamically adaptive, recursively structured triangular grids'. Together they form a unique fingerprint.

Cite this