The numerical simulation of crashworthiness plays an important role in the vehicle design-cycle. With the exception of the contact-impact calculations, the basic solution procedure may be efficiently parallelized using a standard, mesh-partitioning approach. The handling of contact-impact first requires a proximity check to be performed between all nodes and all non-connected elements. Thus, the main parallelization problem is the need for some form of global search algorithm to enable the proximity checks to be performed. This paper reports on the development of a parallel, multi-level strategy for the proximity search including static load balancing. It is shown for an industrial crash problem that communication and computation can be reduced such that a good performance and a high scalability of the parallel crash simulation can be expected. Results of the parallel, multi-level proximity search algorithm implemented in Fortran77 with the message-passing interface PARMACS, will be presented for an IBM SP2.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £82 +P&P)