Publicación: EXPLOITING THE MEMORY HIERARCHY OF MULTICORE SYSTEMS FOR PARALLEL TRIANGULATION REFINEMENT
Fecha
2012
Autores
Título de la revista
ISSN de la revista
Título del volumen
Editor
PARALLEL PROCESSING LETTERS
Resumen
A NOVEL PARALLELIZATION OF THE LEPP-BISECTION ALGORITHM FOR TRIANGULATION REFINEMENT ON MULTICORE SYSTEMS IS PRESENTED. RANDOMIZATION AND WISE USE OF THE MEMORY HIERARCHY ARE SHOWN TO HIGHLY IMPROVE ALGORITHM PERFORMANCE. GIVEN A LIST OF SELECTED TRIANGLES TO BE REFINED, RANDOM SELECTION OF CANDIDATES TOGETHER WITH PRE-FETCHING OF LEPP-SUBMESHES LEAD TO A SCALABLE AND EFFICIENT MULTI-CORE PARALLEL IMPLEMENTATION. THE QUALITY OF THE REFINEMENT IS SHOWN TO BE PRESERVED.
Descripción
Palabras clave
SPEED-UPTHREAD, MULTICORE ARCHITECTURE, MESH REFINEMENT, MEMORY HIERARCHY, LEPP-BISECTION ALGORITHM, CACHE MEMORY
