A new Parallel Algorithm for Casting Simulation on Distributed Memory Computer Architectures

摘要

In this paper a new parallel algorithm for distributed memory computer architectures for the simulation of solidification including convection, mould filling and thermal stresses will be discussed. A good load balancing strategy and the domain decomposition are the main problems and the keys to achieve a good performance. The basic idea is to subdivide the whole domain into smaller cubes (Load Balance Units). The number of fluid cells, as computational weight, defines a weighted graph. Graph partitioning programs, like Metis, can be used to compute a near optimal domain decomposition. Due to the expanding computational domain as the mould filling simulation proceeds, an optimization problem has to be solved for the activation and necessary redistribution of the LBU's. The performance of the new algorithm will be discussed on several benchmarks. A low cost PC-Cluster with up to 32 processors is used and it will be shown that the type of the communication network is important.