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.\parSince 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 repartioning 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.\parIn 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.

References in zbMATH (referenced in 14 articles , 1 standard article )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Lipman, Joseph; Hashimoto, Mitsuyasu: Foundations of Grothendieck duality for diagrams of schemes (2009)
  2. Chu, Yuming; Huang, Manzi; Zhang, Xiaohui: Quasiconformal mappings and Plump domains (2008)
  3. Habel, Annegret; Pennemann, Karl-Heinz; Rensink, Arend: Weakest preconditions for high-level programs (2006)
  4. Edmunds, D. E.; Hurri-Syrjänen, R.: Weighted Hardy inequalities (2005)
  5. Gadducci, Fabio; Montanari, Ugo: Graph processes with fusions: Concurrency by colimits, again (2005)
  6. Plump, Detlef; Steinert, Sandra: Towards graph programs for graph algorithms (2004)
  7. Habel, Annegret; Plump, Detlef: Relabelling in graph transformation (2002)
  8. Edmunds, D. E.; Hurri-Syrjänen, R.: On Hardy-type inequalities (1998)
  9. Taylor, Paul: Intuitionistic sets and ordinals (1996)
  10. Beg, Ivan; Ling, Wu; Müller, Andreas; Przybyszewski, Piotr; Rühl, Roland; Sawyer, William: PLUMP: Parallel library for unstructured mesh problems (1995)
  11. Kuske, Sabine: Implementing (\beta)-reduction by hypergraph rewriting (1995)
  12. Corradini, Andrea; Rossi, Francesca: Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (1993)
  13. Castellini, G.; Koslowski, J.; Strecker, George E.: Categorical closure operators via Galois connections (1992)
  14. Kaplan, Stéphane (ed.); Okada, M. (ed.): Conditional and typed rewriting systems. 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990. Proceedings (1991)