A Parallel 2T-LE Algorithm Refinement with MPI

Abstract

A description is given of an implementation of a parallel refinement algorithm based on the sequential 2T-LE algorithm of bisection into two triangles (Longest-Edge). The proposed algorithm allows refining in parallel the triangulation of a given geometric mesh. The parallel implementation was carried out on a cluster with a Linux platform communicated through a Message Passing Interface (MPI). The results of the parallel refinement show that as the size of the problem increases, better performance is obtained from the parallel algorithm compared to the sequential algorithm.