Aspect ratio for mesh partitioning

  • Ralf Diekmann
  • Robert Preis
  • Frank Schlimbach
  • Chris Walshaw
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1470)


This paper deals with the measure of Aspect Ratio for mesh partitioning and gives hints why, for certain solvers, the Aspect Ratio of partitions plays an important role. We define and rate different kinds of Aspect Ratio, present a new center-based partitioning method which optimizes this measure implicitly and rate several existing partitioning methods and tools under the criterion of Aspect Ratio.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Blazy, W. Borchers, and U. Dralle. Paralleliziation methods for a characteristic’s pressure correction scheme. In Flow Simulation with High-Perf. Comp. II, 1995.Google Scholar
  2. 2.
    J.H. Bramble, J.E. Pasciac, and A.H. Schatz. The construction of preconditioners for elliptic problems by substructering i.+ii. Math. Comp., 47+49, 1986+87.Google Scholar
  3. 3.
    G. Cybenko. Load balancing for distributed memory multiprocessors. J. Par. Distr. Comp., 7:279–301, 1989.CrossRefGoogle Scholar
  4. 4.
    R. Diekmann, F. Schlimbach, and C. Walshaw. Quality balancing for parallel adaptive fem. In IRREGULAR, LNCS. Springer, 1998.Google Scholar
  5. 5.
    N. Chrisochoides Automatic load balanced partitioning strategies for pde computations. In Int. Conf. on Supercomp., pages 99–107, 1989.Google Scholar
  6. 6.
    C. Farhat, N. Maman, and G. Brown. Mesh partitioning for implicit computations via iterative domain decomposition. Int. J. Num. Meth. Engrg., 38:989–1000, 1995.MATHCrossRefGoogle Scholar
  7. 7.
    G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report 95-035, University of Minnesota, 1995.Google Scholar
  8. 8.
    B.W. Kernighan and S. Lin. An effective heuristic procedure for partitioning graphs. The Bell Systems Technical Journal, pages 291–308, Feb 1970.Google Scholar
  9. 9.
    R. Preis and R. Diekmann. The party partitioning-library, user guide, version 1.1. Technical Report TR-RSFB-96-024, Universität-GH Paderborn, Sep 1996.Google Scholar
  10. 10.
    D. Vanderstraeten, R. Keunings, and C Farhat. Beyond conventional mesh partitioning algorithms... In SIAM Conf. on Par. Proc, pages 611–614, 1995.Google Scholar
  11. 11.
    C. Walshaw, M. Cross, and M.G. Everett. A localised algorithm for optimising unstructured mesh partitions. Int. J. Supercomputer Appl., 9(4):280–295, 1995.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Ralf Diekmann
    • 1
  • Robert Preis
    • 1
  • Frank Schlimbach
    • 2
  • Chris Walshaw
    • 2
  1. 1.University of PaderbornGermany
  2. 2.University of GreenwichLondonUK

Personalised recommendations