Skip to main content
Springer Nature Link
Log in

A Shape Optimizing Load Distribution Heuristic for Parallel Adaptive FEM Computations

  • Conference paper
Parallel Computing Technologies (PaCT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3606))

Included in the following conference series:

  • 511 Accesses

Abstract

Load balancing plays an important role in parallel numerical simulations. To address this problem, some general purpose libraries as well as a number of more specific approaches have been developed. Many of them base on vertex exchange operations like the Kerninghan-Lin heuristic which, due to their sequential nature, are hard to parallelize. Furthermore, libraries like Metis and Jostle primarily minimize the edge-cut and cannot obey constraints like connectivity and straight partition boundaries, which are important for some numerical solvers.

In this paper we present a new approach to address the load balancing problem. In contrast to existing heuristics, we are able to guarantee connectivity and the resulting partitions are usually well shaped. Furthermore, our experiments indicate that we can outperform the two parallel state-of-the-art libraries Metis and Jostle also according to the classic metrics like edge-cut and boundary length. The proposed algorithm thereby contains a high degree of natural parallelism, while its drawback is the long run-time, especially if the parallelism is not exploited.

This work is supported by the German Science Foundation (DFG) project SFB-376.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Cybenko, G.: Load balancing for distributed memory multiprocessors. Parallel and Distributed Computing 7, 279–301 (1989)

    Article  Google Scholar 

  2. Diekmann, R., Preis, R., Schlimbach, F., Walshaw, C.: Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM. Parallel Computing 26, 1555–1581 (2000)

    Article  MATH  Google Scholar 

  3. Elsässer, R., Monien, B., Preis, R.: Diffusion schemes for load balancing on heterogeneous networks. Theory of Computing Systems 35, 305–320 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Fox, G., Williams, R., Messina, P.: Parallel Computing Works! Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  5. Hendrickson, B.: Graph partitioning and parallel solvers: Has the emperor no clothes? In: Ferreira, A., Rolim, J.D.P., Teng, S.-H. (eds.) IRREGULAR 1998. LNCS, vol. 1457, pp. 218–225. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Hendrickson, B., Leland, R.: A multi-level algorithm for partitioning graphs. In: Proc. of Supercomputing 1995 (1995)

    Google Scholar 

  7. Hromkovic, J., Monien, B.: The bisection problem for graphs of degree 4. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol. 520, pp. 211–220. Springer, Heidelberg (1991)

    Google Scholar 

  8. Karypis, G., Kumar, V.: MeTis: A Software Package for Partitioning Unstrctured Graphs, Partitioning Meshes, and Computing Fill Reducing Orderings of Sparse Matrices, Version 4.0 (1998)

    Google Scholar 

  9. Kernighan, B.W., Lin, S.: An efficient heuristic for partitioning graphs. Bell Systems Technical Journal 49, 291–308 (1970)

    Google Scholar 

  10. Marquardt, O., Schamberger, S.: Open benchmarks for load balancing heuristics in parallel adaptive finite element computations. Submitted to PDPTA 2005 (2005)

    Google Scholar 

  11. Oliker, L., Biswas, R.: PLUM: Parallel load balancing for adaptive unstructured meshes. Journal of Parallel and Distributed Computing 52(2), 150–177 (1998)

    Article  MATH  Google Scholar 

  12. Sagan, H.: Space Filling Curves. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  13. Schamberger, S.: http://www.upb.de/cs/schaum/benchmark.html

  14. Schamberger, S.: Improvements to the helpful-set heuristic and a new evaluation scheme for graphs-partitioners. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol. 2667, pp. 49–59. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Schamberger, S.: Graph partitioning with the Party library: Helpful-sets in practice. In: Computer Architecture and High Performance Computing, SBAC-PAD 2004, pp. 198–205 (2004)

    Google Scholar 

  16. Schamberger, S.: On partitioning FEM graphs using diffusion. In: HPGC, Intern. Parallel and Distributed Processing Symposium, IPDPS 2004, p. 277 (CD) (2004)

    Google Scholar 

  17. Schamberger, S., Wierum, J.M.: Graph partitioning in scientific simulations: Multilevel schemes vs. space-filling curves. In: Malyshkin, V.E. (ed.) PaCT 2003. LNCS, vol. 2763, pp. 165–179. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Schloegel, K., Karypis, G., Kumar, V.: Multilevel diffusion schemes for repartitioning of adaptive meshes. J. Parallel Distributed Computing 47(2), 109–124 (1997)

    Article  Google Scholar 

  19. Walshaw, C.: The parallel JOSTLE library user guide: Version 3.0 (2002)

    Google Scholar 

  20. Walshaw, C., Cross, M.: Parallel optimisation algorithms for multilevel mesh partitioning. Parallel Computing 26(12), 1635–1660 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  21. Walshaw, C., Cross, M., Diekmann, R., Schlimbach, F.: Multilevel mesh partitioning for optimising domain shape. Intl. J. High Performance Comput. Appl. 13(4), 334–353 (1999)

    Article  Google Scholar 

  22. Zumbusch, G.: Parallel Multilevel Methods: Adaptive Mesh Refinement and Loadbalancing. Teubner (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, Fürstenallee 11, D-33102, Paderborn

    Stefan Schamberger

Authors
  1. Stefan Schamberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Novosibirsk State Technical University,  

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schamberger, S. (2005). A Shape Optimizing Load Distribution Heuristic for Parallel Adaptive FEM Computations. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_23

Download citation

  • DOI: https://doi.org/10.1007/11535294_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28126-9

  • Online ISBN: 978-3-540-31826-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics