Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Solving Irregularly Structured Problems in Parallel

IRREGULAR 1998: Solving Irregularly Structured Problems in Parallel pp 144–155Cite as

Dynamic load balancing for parallel adaptive mesh refinement

  • Regular Talks
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1457))

Abstract

Adaptive mesh refinement is a key problem in large-scale numerical calculations. The need of adaptive mesh refinement could introduce load imbalance among processors, where the load measures the amount of work required by refinement itself as well as by numerical calculations thereafter. We present a dynamic load balancing algorithm to ensure that the work load are balanced while the communication overhead is minimized. The main ingredient of our method is a technique for the estimation of the size and the element distribution of the refined mesh before we actually generate the refined mesh. Base on this estimation, we can reduce the dynamic load balancing problem to a collection of static partitioning problems, one for each processor. In parallel each processor could then locally apply a static partitioning algorithm to generate the basic units of submeshes for load rebalancing. We then model the communication cost of moving submeshes by a condensed and much smaller subdomain graph, and apply a static partitioning algorithm to generate the final partition.

Supported in part by the Academic Strategic Alliances Program (ASCI) of U.S. Department of Energy, and by an NSF CAREER award (CCR-9502540) and an Alfred P. Sloan Research Fellowship.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bern, D. Eppstein and J. R. Gilbert, Provably good mesh generation. In 31st Annual Symposium on Foundations of Computer Science, IEEE, 231–241, 1990.

    Google Scholar 

  2. L. Paul Chew, Nikos Chrisochoides, Florian Sukup. Parallel constrained delaunay meshing. Trends in Unstructured Mesh Generation edited by S.A.Canann and S.Saigal, pp89–96, 1997.

    Google Scholar 

  3. J. R. Gilbert, G. L. Miller, and S.-H. Teng. Geometric mesh partitioning: Implementation and experiments. SIAM J. Scientific Computing, to appear, 1998.

    Google Scholar 

  4. B. Hendrickson and R. Leland. The Chaco user's guide, Version 1.0. Technical Report SAND93-2339, Sandia National Laboratories, Albuquerque, NM, 1993.

    Google Scholar 

  5. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Scientific Computing to appear, 1997.

    Google Scholar 

  6. G. L. Miller, S. H. Teng, W. Thurston, and S. A. Vavasis. Automatic mesh partitioning. In A. George, J. Gilbert, and J. Liu, editors, Sparse Matrix Computations: Graph Theory Issues and Algorithms, IMA Volumes in Mathematics and its Applications. Springer-Verlag, pp57–84, 1993.

    Google Scholar 

  7. G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis. Geometric separators for finite element meshes. SIAM J. Scientific Computing, to appear, 1998.

    Google Scholar 

  8. G. L. Miller, D. Talmor, S.-H. Teng, and N. Walkington. A Delaunay based numerical method for three dimensions: generation, formulation, and partition. In Proc. 27th Annu. ACM Sympos. Theory Comput., pages 683–692, 1995.

    Google Scholar 

  9. S. A. Mitchell and S. A. Vavasis. Quality mesh generation in three dimensions. Proc. ACM Symposium on Computational Geometry, pp 212–221, 1992.

    Google Scholar 

  10. T.Okusanya, J.Peraire, 3D parallel unstructured mesh generation. Trends in Unstructured Mesh Generation edited by S.A.Canann and S.Saigal, pp109–116, 1997.

    Google Scholar 

  11. M. L.Staten and S. A. Canann. Post refinement element shape improvement for quadrilateral meshes. Trends in Unstructured Mesh Generation edited by S.A.Canann and S.Saigal, pp9–16, 1997.

    Google Scholar 

  12. G. Strang and G. J. Fix. An Analysis of the Finite Element Method, Prentice-Hall, 1973.

    Google Scholar 

  13. S.-H. Teng. A geometric approach to parallel hierarchical and adaptive computing on unstructured meshes. In Fifth SIAM Conference on Applied Linear Algebra, pages 51–57, June 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Center for Simulation of Advanced Rockets, University of Illinois, Urbana-Champaign, 61801, Urbana, IL

    Xiang-Yang Li & Shang-Hua Teng

Authors
  1. Xiang-Yang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shang-Hua Teng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alfonso Ferreira José Rolim Horst Simon Shang-Hua Teng

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, XY., Teng, SH. (1998). Dynamic load balancing for parallel adaptive mesh refinement. In: Ferreira, A., Rolim, J., Simon, H., Teng, SH. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1998. Lecture Notes in Computer Science, vol 1457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018535

Download citation

  • DOI: https://doi.org/10.1007/BFb0018535

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64809-3

  • Online ISBN: 978-3-540-68533-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation