A Parallel 2T-LE Algorithm Refinement with MPI

Authors

  • Lorna Figueroa
  • Mauricio Solar
  • Ma. Cecilia Rivara
  • Ma. Clicia Stelling

DOI:

https://doi.org/10.19153/cleiej.12.2.5

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.

Downloads

Published

2009-08-01

Issue

Vol. 12 No. 2 (2009): Regular Issue with one invited Paper

Section

Articles

License

CLEIej is supported by its home institution, CLEI, and by the contribution of the Latin American and international researchers community, and it does not apply any author charges whatsoever for submitting and publishing. Since its creation in 1998, all contents are made publicly accesibly. The current license being applied is a (CC)-BY license (effective October 2015; between 2011 and 2015 a (CC)-BY-NC license was used).