Skip to main content

A general approach for an automatic parallelization applied to the finite element code PERMAS

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 919))

Included in the following conference series:

Abstract

The general purpose Finite Element system PERMAS is ported to highly parallel computer architectures in the scope of the ESPRIT project EUROPORT-1. The goal is to have only one version for sequential and parallel machine architectures, simplifying the maintenance and protecting further investments in the software. Starting from the existing data structures for large, sparsely populated matrices, a programming tool called PTM was designed and implemented that allows the handling and manipulation of matrices at a very high level of abstraction. All access to the data is performed through references thus hiding the location of the data and hence the type of memory (distributed, shared, virtually shared) from the user of PTM. All programming above the PTM interface is therefore independent of the machine architecture. Current versions of PTM cover sequential and distributed memory machines using message passing. A clustering algorithm distributes the work such that the communication on the network is kept at a minimum.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gerasoulis, A. and Yang, T.,“Scheduling Program Task Graphs on MIMD Architectures”, in Parallel Algorithm Derivation and program Transformation. Eds: R. Paige, J. Reif and R. Watcher. Kluwer Academic Publishers. 1993.

    Google Scholar 

  2. Gerasoulis, A. and Yang, T.“A Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors”, Proc. of Supercomputing '91. IEEE.

    Google Scholar 

  3. Kim, S.J. and Browne, J.C.,“A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures”, Proc. of Int. Conf on Parallel Processing, Vol.3 1988, pp.1–8.

    Google Scholar 

  4. Wu, M.Y. and Gajsky, D., “A Programming Aid for Hypercube Architectures”, Journal of Supercomputing, Vol. 2, 1988, pp. 349–372.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bob Hertzberger Giuseppe Serazzi

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ast, M., Labarta, J., Manz, H., Perez, A., Schulz, U., Solé, J. (1995). A general approach for an automatic parallelization applied to the finite element code PERMAS. In: Hertzberger, B., Serazzi, G. (eds) High-Performance Computing and Networking. HPCN-Europe 1995. Lecture Notes in Computer Science, vol 919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0046724

Download citation

  • DOI: https://doi.org/10.1007/BFb0046724

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59393-5

  • Online ISBN: 978-3-540-49242-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics