Sage Journals: Discover world-class research

Abstract

The general-purpose finite element system PERMAS has been ported to parallel computer architectures within the scope of the ESPRIT project EUROPORT-1. The kernel of this 1 M lines of code has been restructured in such a way that parallelism is automatically identified and exploited at runtime. This paper describes the general structure of the approach and the evaluations and models carried out to analyze the potential performance of different algorithms. The study shows the performance bounds of the applica tion, the efficiency of the scheduling algorithms, and the influence of architectural parameters of the target ma chine. The paper also describes some issues of relevance of the approach for such an industrial code. Among them, issues of compatibility with previous versions, reduction of future development, and maintenance costs are addressed.

Get full access to this article

View all access options for this article.

References

Chong, F.T. , and Schreiber, R. 1995. Parallel sparse triangular solution with partitioned inverses and prescheduled dags. Paper presented at the Workshop on Solving Irregular Problems on Distributed Memory Machines, Santa Barbara, CA.

Chretienne, P. 1989. Task scheduling over distributed memory machines. In Proceedings of the International Workshop on Parallel and Distributed Algorithms Amsterdam: North-Holland.

El-Rewini, H. , Lewis, T. , and Ali, H.H. 1994. Task scheduling in parallel and distributed systems . Englewood Cliffs, NJ: Prentice Hall.

Gerasoulis, A. , and Yang, T. 1992. A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors. Journal of Parallel and Distributed Computing 16:276-291.

Graham, R.L. 1969. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17:416-429.

Kim, S.J. , and Browne, J.C. 1988. A general approach to mapping of parallel computation upon multiprocessor architectures. International Conference on Parallel Processing 3:1-8.

Kruatrachue, B. , and Lewis, T. 1988. Grain size determination for parallel processing . IEEE Software, 23-32.

Labarta, J. , Girona, S. , Fillet, V. , Cortes, T. , and Gregoris, L. 1996. Dip: A parallel program development environment . Paper presented at Europar '96, Lyon, France.

Lenstra, J.K. , and Rinnooy Kan, A.H.G. 1978. Complexity of scheduling under precedence constraints. Operation Research 26:1.

10.

Papadimitriou, C. , and Yannakakis, M. 1990. Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19:322-328.

11.

Sarkar, V. 1989. Partitioning and scheduling parallel programs for execution on multiprocessors. Cambridge: MIT Press.

12.

Schulz, U. , Ast, M. , Labarta, J. , Manz, H. , and Perez, A. 1996. Experiences and achievements with the parallelization of a large finite element system. Paper presented at HPCN'96, Brussels, Belgium.

13.

Wu, M.Y. , and Gajski, D.A. 1988. A programming aid for hypercube architectures. Journal of Supercomputing 2:349-372.

14.

Yang, T. , and Gerasoulis, A. 1991. A fast static scheduling algorithm for dags on an unbounded number of processors. Proc. on Supercomputing 91 IEEE, pp. 633-642.

Runtime Parallelization of the Finite Element Code Permas

Abstract

Get full access to this article

References