No abstract

No abstract

No abstract

No abstract

This paper describes a parallel algorithm for Dynamic Relaxation Method. The basic theory of the Dynamic Relaxation is presented in brief 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 problem on transputer-based syetems. The evolution of the algorithm is given by identifying the steps which could be executed in parallel. The structure of the parallel code is discussed and then described algorithmically. Two geometrically non-linear parallel finite element analysis have been performed using different mesh densities. The number of processors was varied to investigate algorithm efficiency and "speed ups". From the results obtained it is shown that the compuational efficiency increases when the computational load per processor is increased.