Load balancing issues in the prepartitioning method

  • Jérôme Galtier
Workshop 15: Scheduling and Load Balancing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1300)


An original approach to the partitioning of 3D meshes (typically for the finite element method is presented. Our technique applies on sub-domains defined by their polyhedrical boundary. It relies on the meshing of interfaces between sub-domains before meshing the domain itself.

Since this idea basically trades smoothness, small-size, and regularity of the interfaces for unbalance, we describe a fast, efficient, linear-time evaluation algorithm that correct this default. Its use is experienced with industrial benchmarks, and compared with other heuristic schemes.


Mesh partitioning load balancing 3D finite element method large irregular data structures 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    V. Aghoskov and V. Lebedev. The Poincaré-Steklov's operators and the domain decomposition in variational problems. Computational Processes and Systems, pages 173–227, 1985.Google Scholar
  2. 2.
    Geoffrey Butlin and Clive Stops. CAD Data Repair. In Proceedings of the 5th International Meshing Roundtable, pages 7–12, 1996.Google Scholar
  3. 3.
    T. Chan and T. Mathew. Domain decomposition algorithms. Acta Numer., 8:, 1993.Google Scholar
  4. 4.
    H. S. de Cougny and M. S. Shephard. Surface meshing using vertex insertion. In Proceedings of the 5th International Meshing Roundtable, pages 243–256, 1996.Google Scholar
  5. 5.
    Q. Dinh, R. Glowinski, and J. Périaux. Solving elliptic problems by domain decomposition methods with applications. In G. Birkhoff and A. Schoenstadt, editors, Elliptic Problem Solvers II, pages 395–426. Academic Press, New York, 1984.Google Scholar
  6. 6.
    Jérôme Galtier and Paul Louis George. Prepartitioning as a way to mesh subdomains in parallel. In Proceedings of the 5th International Meshing Roundtable, pages 107–121, 1996.Google Scholar
  7. 7.
    P. L. George, F. Hecht, and E. Saltel. Automatic mesh generator with specified boundary. Computer Methods in Applied Mechanics and Engineering, 92:269–288, 1991.Google Scholar
  8. 8.
    Paul Louis George. Génération de maillages par une méthode de type Voronoï. Technical Report RR-1398, INRIA, 1991.Google Scholar
  9. 9.
    Gerhard Globisch. On an automatically parallel generation technique for tetrahedral meshes. Parallel Computing, 21:1979–1995, 1995.Google Scholar
  10. 10.
    D. Keyes and W. Groop. A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation. SIAM J. Sci. Stat. Comput., 8:166–202, 1987.Google Scholar
  11. 11.
    R. Löhner and P. Parikh. Three-dimensional grid generation by the advancing-front method. Int. J. Numer. Meth. Fluids, 8:1135–1149, 1988.Google Scholar
  12. 12.
    F.P. Preparata and M.I. Shamos. Computational geometry, an introduction. Springer-Verlag, 1985.Google Scholar
  13. 13.
    Alexander Shostko and Rainald Löhner. Three-dimensional parallel unstructured grid generation. Inter. J. Num. Meth. Engn, 38:905–925, 1995.Google Scholar
  14. 14.
    P. Le Tallec. Domain decomposition method in computational mechanics. Computational Mechanics Advances, 1(2):121–220, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Jérôme Galtier
    • 1
    • 2
  1. 1.Department of Computer ScienceUniversity of Versailles Saint-QuentinFrance
  2. 2.Electicité de FranceDirection des Etudes et RecherchesFrance

Personalised recommendations