Tools to support mesh adaptation on massively parallel computers

  • Authors:
  • Min Zhou;Ting Xie;Seegyoung Seol;Mark S. Shephard;Onkar Sahni;Kenneth E. Jansen

  • Affiliations:
  • Rensselaer Polytechnic Institute, Scientific Computation Research Center, 12180, Troy, NY, USA;Rensselaer Polytechnic Institute, Scientific Computation Research Center, 12180, Troy, NY, USA;Rensselaer Polytechnic Institute, Scientific Computation Research Center, 12180, Troy, NY, USA;Rensselaer Polytechnic Institute, Scientific Computation Research Center, 12180, Troy, NY, USA;Rensselaer Polytechnic Institute, Scientific Computation Research Center, 12180, Troy, NY, USA;University of Colorado at Boulder, Department of Aerospace Engineering Sciences, 429 UCB, 80309, Boulder, CO, USA

  • Venue:
  • Engineering with Computers - Special Issue: The Mesh Trends Symposium
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The scalable execution of parallel adaptive analyses requires the application of dynamic load balancing to repartition the mesh into a set of parts with balanced work load and minimal communication. As the adaptive meshes being generated reach billions of elements and the analyses are performed on massively parallel computers with 100,000’s of computing cores, a number of complexities arise that need to be addressed. This paper presents procedures developed to deal with two of them. The first is a procedure to support multiple parts per processor which is used as the mesh increases in size and it is desirable to partition the mesh to a larger number of computing cores than are currently being used. The second is a predictive load balancing method that sets entity weights before dynamic load balancing steps so that the mesh is well balanced after the mesh adaptation step thus avoiding excessive memory spikes that would otherwise occur during mesh adaptation.