PARALLEL EXPLICIT UNSTRUCTURED GRID SOLVERS ON DISTRIBUTED-MEMORY COMPUTERS

This paper presents a general strategy, based on a high level of abstr action, designed in order to reduce the development time and cost of p arallel explicit finite element codes. Such a level of abstraction pro vides a general, rigorous, and efficient framework to tackle the paral lelisation of various solvers. The intention of this work is not to do an exhaustive study and make comparisons of different platforms, but rather to bring some quantitative input of the efficiency of the prese nted parallel implementation strategy. The results, obtained so far, s how that a good scalability is achieved on parallel architectures such as the Gray T3D. They demonstrate that solutions that took days on a sequential machine can be reduced to hours or minutes on a parallel ma chine, such as the Gray T3D. Copyright (C) 1996 Elsevier Science Limit ed