Parallel computation schemes for dynamic relaxation Available to Purchase

This paper describes a parallel algorithm for the dynamic relaxation(DR) method. The basic theory of the dynamic relaxation is briefly reviewed to prepare the reader for the parallel implementation of the algorithm. Some fundamental parallel processing schemes have been explored for the implementation of the algorithm. Geometric Parallelism was found suitable for the DR method when using transputer‐based systems. The evolution of the parallel algorithm is given by identifying the steps which may be executed in parallel. The structure of the parallel code is discussed and then described algorithmically. Two geometrically non‐linear parallel finite element analyses have been performed using different mesh densities. The number of processors was varied to investigate algorithm efficiency and speed ups. Using the results obtained it is shown that the computational efficiency increases when the computational load per processor is increased.