RT info:eu-repo/semantics/conferenceObject
T1 Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
A1 Cintra, Marcelo
A1 Llanos Ferraris, Diego Rafael
A1 Palop del Río, Belén
K1 Informática
K1 1203 Ciencia de Los Ordenadores
K1 3304 Tecnología de Los Ordenadores
AB 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.
PB Springer
YR 2004
FD 2004
LK https://uvadoc.uva.es/handle/10324/75869
UL https://uvadoc.uva.es/handle/10324/75869
LA eng
NO International Conference on Computational Science and Its Applications (ICCSA 2004), Perugia, Italy.
NO Producción Científica
DS UVaDOC
RD 29-jun-2025