Publicación:
MULTITHREAD PARALLELIZATION OF LEPP-BISECTION ALGORITHMS

Vista sencilla de ítem
dc.creatorPEDRO ANGEL RODRÍGUEZ MORENO
dc.date2012
dc.date.accessioned2025-01-10T14:45:14Z
dc.date.available2025-01-10T14:45:14Z
dc.date.issued2012
dc.description.abstractLONGEST 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.
dc.formatapplication/pdf
dc.identifier.doi10.1016/j.apnum.2011.07.011
dc.identifier.issn1873-5460
dc.identifier.issn0168-9274
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/8822
dc.languagespa
dc.publisherAPPLIED NUMERICAL MATHEMATICS
dc.relation.uri10.1016/j.apnum.2011.07.011
dc.rightsPUBLICADA
dc.subjectTRIANGULATION REFINEMENT
dc.subjectPARALLEL MULTITHREAD REFINEMENT
dc.subjectLONGEST EDGE BISECTION
dc.subjectLEPP-BISECTION ALGORITHM
dc.subjectFINITE ELEMENT METHOD
dc.titleMULTITHREAD PARALLELIZATION OF LEPP-BISECTION ALGORITHMS
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE SISTEMAS DE INFORMACION
ubb.SedeCONCEPCIÓN
Archivos
Colecciones
Artículos científicos