Evaluation of Hierarchical Mesh Reorderings

  • Alex Pothen
ORKG logo Add to ORKG
Publication date
March 2015

Abstract

Abstract. Irregular and sparse scientific computing programs frequently experience performance losses because of inefficient use of the memory system in most machines. Previous work has shown that, for a graph model, performing a partitioning and then reordering within each par-tition (hierarchical reordering) improves performance. More recent work has shown that reordering heuristics based on a hypergraph model re-sult in better reorderings than those based on a graph model. This paper studies the effects of hierarchical reordering strategies within the hyper-graph model. In our experiments, the reorderings are applied to the nodes and elements of tetrahedral meshes, which are used as input to a mesh optimization application. This applicat...

Extracted data

Related items

Theoretical measures of cache efficiency for tetrahedral adaptive meshes - A case study with a quasi space-filling curve order
  • Kunst, O.
  • Behrens, J.
January 2014

We present a case study to improve the cache efficiency for a simulation on a tetrahedral bisection-...

Metrics and models for reordering transformations
  • Michelle Mills Strout
  • Paul D. Hovland
January 2004

Irregular applications frequently exhibit poor performance on contemporary computer architectures, i...

Improving Memory Hierarchy Performance for Irregular Applications*
  • John Mellor-crummeyt
  • David Whalleyz
  • Ken Kennedy
October 2015

The gap between CPU speed and memory speed in modern com-puter systems is widening as new generation...

We use cookies to provide a better user experience.