Advertisement

Plump: Parallel Library for Unstructured Mesh Problems

  • Ivan Beg
  • Wu Ling
  • Andreas Müller
  • Piotr Przybyszewski
  • Roland Rühl
  • William Sawyer
Chapter

Abstract

The Joint CSCS-ETH/NEC Collaboration in Parallel Processing is creating a tool environment for porting large and complex codes to massively parallel computers. Along with a parallel debugger and a performance monitor, this environment provides a Parallelization Support Tool (PST) to supplement the data-parallel programming language High Performance Fortran (HPF). Whereas HPF has only facilities for regular data decompositions, PST supports user-defined mappings of the global name space to individual processors, allowing for the parallelization of unstructured problems.

Since the additional directives of PST alone do not remove all of the complexity of programming parallel unstructured mesh applications, a Parallel Library for Unstructured Mesh Problems (PLUMP) is currently being developed at CSCS to support the local refinement and dynamic repartitioning of meshes distributed over a processor array. The constituent routines simplify the manipulation of the underlying dynamic data structures. The use of PLUMP in conjunction with PST can facilitate the design and implementation of a class of specific, but industrially important, applications.

In this paper we first specify the functionality of PLUMP, and then discuss its use in parallelizing two unstructured problems with dynamic aspects, namely a tight binding molecular dynamics code and a finite-element package. Finally we indicate some possible future additions to the library and discuss other future applications.

Keywords

Mesh Refinement Element Insertion Global Matrix Tool Environment Unstructured Problem 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C. Clémençon, K. M. Decker, A. Endo, J. Fritscher, N. Masuda, A. Müller, R. Rühl, W. Sawyer, E. de Sturler, B. J. N. Wylie, and F. Zimmermann, “Application-Driven Development of an Integrated Tool Environment for Distributed Memory Parallel Processors,” in Proceedings of the First International Workshop on Parallel Processing (Bangalore, India, Dec. 27–30), Dec. 1994.Google Scholar
  2. [2]
    C. Koelbel, D. Loveman, R. Schreiber, G. Steele, Jr, and M. Zosel, The High Performance Fortran Handbook. The MIT Press, 1994.Google Scholar
  3. [3]
    C. Clémençon and A. Endo and J. Fritscher and A. Müller and R. Rühl and B. J. N. Wylie, “The ”Annai“ Environment for Portable Distributed Parallel Programming,” in 28th Hawaii International Conference on System Sciences, (Maui International Resort, Wailea, Maui, Hawaii), IEEE, May 1995.Google Scholar
  4. [4]
    H. Berryman, J. Saltz, and J. Scroggs, “Execution time support for adaptive scientific algorithms on distributed memory machines,” Concurrency: Practice and Experience, vol. 3, June 1991.Google Scholar
  5. [5]
    D. A. Burgess, P. I. Crumpton, and M. B. Giles, “A parallel framework for unstructured grid solvers,” in Proceedings of the IFIP WG10.8 Working Conference on Programming for Massively Parallel Distributed Systems, April 25–29, 1994, ( California ), April 1993.Google Scholar
  6. [6]
    B. Chapman, P. Mehrotra, and H. Zima, “Extending HPF for advanced data parallel applications,” Tech. Rep. TR 94–7, Institute for Software Technology and Parallel Systems, University of Vienna, Austria, 1994.Google Scholar
  7. [7]
    R. v. Hanxleden, K. Kennedy, and J. Saltz, “Value-based distributions in fortran d.” Draft, 1994.Google Scholar
  8. [8]
    R. Rühl, A Parallelizing Compiler for Distributed-Memory Parallel Processors. PhD thesis, ETH-Zürich, 1992. Published by Hartung-Gorre Verlag, Konstanz, Germany.Google Scholar
  9. [9]
    A. Müller and R. Rühl, “Extending High Performance Fortran for the Support of Unstructured Computations,” Technical Report SeRD-CSCS-TR94–08, Centro Svizzero di Calcolo Scientifico, CH-6928 Manno, Switzerland, Nov. 1994.Google Scholar
  10. [10]
    C. Pommerell and R. Rühl, “Migration of Vectorized Iterative Solvers to Distributed Memory Architectures,” in Colorado Conference on Iterative Methods (Breckenridge, Colorado, April 1994), 1994. Preliminary proceedings, accepted for publication in SIAM J. Sci. Comput.Google Scholar
  11. [11]
    A. Pothen, H. D. Simon, and K.-P. Liou, “Partitioning sparse matrices with eigenvectors of graphs,” SIAM Journal on Matrix Analysis and Applications, vol. 11, pp. 430–452, 1990.MathSciNetMATHCrossRefGoogle Scholar
  12. [12]
    E. H. Cuthill and J. McKee, “Reducing the bandwidth of sparse symmetric matrices,” in Proceedings of the 24th Nat. Conf. Assoc. Comp. Mach., pp. 157–172, ACM, 1969.Google Scholar
  13. [13]
    Y. Saad, “SPARSKIT: A basic tool kit for sparse matrix computation,” Tech. Rep. CSRD Report no. 1029, University of Illinois, CSRD, August 1990.Google Scholar
  14. [14]
    T. J. R. Hughes, J. Winget, I. Levit, and T. E. Tezduyar, “New alternating direction procedures in finite element analysis based upon EBE approximate factorization,” in Computer Methods for Nonlinear Solids and Mechanics, pp. 75–109, New York: ASME, 1983.Google Scholar
  15. [15]
    J. Korvink, An Implementation of the Adaptive Finite Element Method for Semiconductor Sensor Simulation. PhD thesis, ETH-Zürich, Nov. 1993. Verlag der Fachvereine Zürich, Bericht Nr. 8.Google Scholar
  16. [16]
    H. A. van der Vorst, “Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems,” SIAM J. Sci. Stat. Comput., vol. 13, pp. 631–644, Mar. 1992.MathSciNetMATHCrossRefGoogle Scholar
  17. [17]
    L. Colombo, “Tight-binding molecular dynamics: Present status and perspectives,” in Proceedings of PC’94, CSCS, Aug. 1994.Google Scholar
  18. [18]
    J. J. M. Cuppen, “A divide and conquer method for the symmetric tri-diagonal eigenproblem,” Numerische Mathematik, vol. 36, pp. 177–195, 1981.MathSciNetMATHCrossRefGoogle Scholar
  19. [19]
    J. J. Dongarra and D. C. Sorensen, “A fully parallel algorithm for the symmetric eigenvalue problem,” Scientific and Statistical Computing, vol. 8, pp. 139–154, Mar. 1987.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1995

Authors and Affiliations

  • Ivan Beg
    • 1
  • Wu Ling
    • 2
  • Andreas Müller
    • 3
  • Piotr Przybyszewski
    • 4
  • Roland Rühl
    • 3
  • William Sawyer
    • 3
  1. 1.University of TorontoOntarioCanada
  2. 2.Stanford UniversityUSA
  3. 3.Centro Svizzero di Calcolo Scientifico (CSCS-ETHZ)MannoSwitzerland
  4. 4.Technical University of GdanskPoland

Personalised recommendations