Location of Repository

Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes

By Kirk Schloegel, George Karypis and Vipin Kumar

Abstract

Existing state-of-the-art schemes for dynamic repartitioning of adaptive meshes can be classi#ed as either di#usion-based schemes or scratch-remap schemes. We present a new scratch-remap scheme called Locally-Matched Multilevel Scratch-Remap #or simply LMSR#. The LMSR scheme tries to compute a partitioning that has a high overlap with the existing partitioning. We show that LMSR decreases the amountofvertex migration required to balance the graph compared to current scratch-remap schemes, particularly for slightly imbalanced graphs. We describe a new di#usion-based scheme that we refer to as Wavefront Di#usion. In Wavefront Di#usion, the #ow of vertices moves in a wavefront from overweight to underweight domains. We show that Wavefront Di#usion obtains signi#cantly lower vertex migration requirements while maintaining similar or better edge-cut results compared to existing di#usion algorithms, especially for highly imbalanced graphs. Furthermore, we compare Wavefront Di#usion ..

Topics: Dynamic Graph Partitioning, Multilevel Di usion, Scratch-Remap, Wavefront Di usion, LMSR, Adaptive Mesh Computations
Year: 1998
OAI identifier: oai:CiteSeerX.psu:10.1.1.41.9717
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www-users.itlabs.umn.ed... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.