An Integrated Decomposition and Partitioning Approach for Irregular Block-Structured Applications

  • Jarmo Rantakokko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1800)


We present an integrated domain decomposition and data partitioning approach for irregular bloc k-structured methods in scientific computing. We have demonstrated the method for an application related to Ocean modeling. Our approach gives better results than other methods that we have found in the literature. We have compared the domain decomposition part with the Berger-Rigoutsos point clustering algorithm and the partitioning part with a multilevel method used in Metis, a bin packing method, and an in verse space filling curve algorithm. The partitions produced with our approach give lower run times, i.e. higher parallel efficiency, for our application than all the other partitions we have tried. Moreover, the integrated approach gives a possibility to further improve the parallel efficiency compared to doing the decomposition and partitioning in two separate steps.


Load Balance Domain Decomposition Active Point Water Point Homogeneous Dirichlet Boundary Condition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M.J. Berger, S. Bokhari, A partitioning strategy for non-uniform problems on multiprocessors, ICASE Report No. 85-55, NASA Langely Research Center, Hampton VA, 1985.Google Scholar
  2. 2.
    M.J. Berger, I. Rigoutsos, An algorithm for point clustering and grid generation, IEEE Transactions on Systems, Man and Cybernetics, 21(1991), pp. 1278–1286.CrossRefGoogle Scholar
  3. 3.
    R. Bleck, S. Dean, M. O’Keefe, A. Sawdey, A comparison of data-parallel and message-passing versions of the Miami Isopycnic Coordinate Ocean Model (MICOM), Parallel Computing, 21:1695–1720, 1995.zbMATHCrossRefGoogle Scholar
  4. 4.
    C.M. Fiduccia, R.M. Mattheyses, A Linear-Time Heuristic for Improving Network Partitions, in Proceedings of 19th IEEE Design Automation Conference, IEEE, pp. 175–181, 1982.Google Scholar
  5. 5.
    G.S. Gwilliam, The OCCAM Global Ocean Model, in Proceedings of the sixth ECMWF workshop on the use of parallel processors in meteorology, Reading, UK, November 21–25, 1994.Google Scholar
  6. 6.
    M.A. Iqbal, J.H. Saltz, S.H. Bohkari, Performance tradeoffs in static and dynamic load balancing strategies, Technical Report 86-13, ICASE, NASA Langley Research Center, Hampton, VA, 1986.Google Scholar
  7. 7.
    G. Karypis, V. Kumar, Metis: Unstructured Graph Partitioning and Sparse Matrix Ordering System, Technical Report, University of Minnesota, Department of Computer Science, Minneapolis, 1995.Google Scholar
  8. 8.
    S. Kohn, A Parallel Software Infrastructure for Dynamic Block-Irregular Scientific Calculations, UCSD CSE Dept. Tech. Rep. CS95-429, (Ph.D. Dissertation), Jun. 1995.Google Scholar
  9. 9.
    C. Ou, S. Ranka, Parallel remapping algorithms for adaptive problems, Technical Report, Center for Research on Parallel Computation, Rice University, 1994.Google Scholar
  10. 10.
    M. Parashar, J. Brown, On Partitioning Dynamic Adaptive Grid Hierarchies, Technical Report, Department of Computer Science, University of Texas, Austin, 1996.Google Scholar
  11. 11.
    J. Quirk, A parallel adaptive grid algorithm for computational shock hydrodynamics, Applied Numerical Mathematics, 20:427–453, Elsevier, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    J. Rantakokko, A framework for partitioning structured grids with inhomogeneous workload, Parallel Algorithms and Applications, Vol 13, pp:135–151, 1998.zbMATHMathSciNetGoogle Scholar
  13. 13.
    J. Rantakokko, Data Partitioning Methods and Parallel Block-Oriented PDE Solvers, Ph.D. thesis, Department of Scientific Computing, Uppsala University, Sweden, 1998.zbMATHGoogle Scholar
  14. 14.
    H.D. Simon, Partitioning of unstructured problems for parallel processing, Computing Systems in Engineering, 2:135–148, 1991.CrossRefGoogle Scholar
  15. 15.
    M.F. Wheeler, T. Arbogast, S. Bryant, J. Eaton, Q. Lu, M. Peszynska, A Parallel Multiblock/Multidomain Approach for Reservoir Simulation, in proceedings of the 1999 SPE Reservoir Simulation Symposium, Houston, Texas, 14–17 February, 1999.Google Scholar
  16. 16.
    T. Wilhelmsson, J. Schüle, J. Rantakokko, L. Funkquist, Increasing Resolution and Forecast Length with a Parallel Ocean Model, in proceedings of the Second EuroGOOS International Conference, Rome, Italy, March 11–13, 1999.Google Scholar
  17. 17.
    T. Wilhelmsson, J. Schüle, Running an Operational Baltic Sea Model on the T3, in proceedings of the Fifth European SGI/Cray MPP Workshop, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Jarmo Rantakokko
    • 1
  1. 1.Dept. of Computer Science and EngineeringUniversity of California, San DiegoLa JollaUSA

Personalised recommendations