Multithread parallelization of Lepp-bisection algorithms
Artículo
Open/ Download
Publication date
2012Metadata
Show full item record
Cómo citar
Rivara Zúñiga, María Cecilia
Cómo citar
Multithread parallelization of Lepp-bisection algorithms
Abstract
Longest edge (nested) algorithms for triangulation refinement in two dimensions are able
to produce hierarchies of quality and nested irregular triangulations as needed both for
adaptive finite element methods and for multigrid methods. They can be formulated
in terms of the longest edge propagation path (Lepp) and terminal edge concepts, to
refine the target triangles and some related neighbors. We discuss a parallel multithread
algorithm, where every thread is in charge of refining a triangle t and its associated Lepp
neighbors. The thread manages a changing Lepp(t) (ordered set of increasing triangles)
both to find a last longest (terminal) edge and to refine the pair of triangles sharing
this edge. The process is repeated until triangle t is destroyed. We discuss the algorithm,
related synchronization issues, and the properties inherited from the serial algorithm. We
present an empirical study that shows that a reasonably efficient parallel method with
good scalability was obtained.
Patrocinador
This work was partially supported by the Department of Computer Science, University of Chile; and by the Spanish
Government, “Secretaría de Estado de Universidades e Investigación”, “Ministerio de Ciencia e Innovación”, and FEDER, grant
contracts: CGL2008-06003-C03 and UNLP08-3E-010.
Identifier
URI: https://repositorio.uchile.cl/handle/2250/125589
DOI: doi:10.1016/j.apnum.2011.07.011
Quote Item
Applied Numerical Mathematics 62 (2012) 473–488
Collections