Por favor, use este identificador para citar o enlazar este ítem:https://uvadoc.uva.es/handle/10324/75869
Título
Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
Congreso
International Conference on Computational Science and Its Applications, ICCSA 2004
Año del Documento
2004
Editorial
Springer
Descripción Física
10 p.
Descripción
Producción Científica
Documento Fuente
International Conference on Computational Science and Its Applications (ICCSA 2004), Perugia, Italy.
Resumo
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the development of complex data structures or hard to implement algorithms. Randomized algorithms appear in this scenario as a very useful tool in order to obtain easier implementations within a good expected time bound. However, parallel implementations of these algorithms are hard to develop and require an in-depth understanding of the language, the compiler and the underlying parallel computer architecture. In this paper we show how we can use speculative parallelization techniques to execute in parallel iterative algorithms such as randomized incremental constructions. In this paper we focus on the convex hull problem, and show that, using our speculative parallelization engine, the sequential algorithm can be automatically executed in parallel, obtaining speedups with as little as four processors, and reaching 5.15x speedup with 28 processors.
Materias (normalizadas)
Informática
Materias Unesco
1203 Ciencia de Los Ordenadores
3304 Tecnología de Los Ordenadores
Version del Editor
Idioma
eng
Tipo de versión
info:eu-repo/semantics/publishedVersion
Derechos
openAccess
Aparece en las colecciones
Arquivos deste item