In this article, we show that many sequential randomized incremental algorithms are in fact
parallel. We consider algorithms for several problems, including Delaunay triangulation …

The randomized incremental convex hull algorithm is one of the most practical and important
geometric algorithms in the literature. Due to its simplicity, and the fact that many points or …

In this work, we address the problem of scheduling loops with dependences in the context of
speculative parallelization. We show that the scheduling alternatives are highly influenced …

Scheduling for speculative parallelization is a problem that remained unsolved despite its
importance. Simple methods such as Fixed-Size Chunking (FSC) need several'dry-runs' …

New non-volatile memory (NVM) technologies are projected to become the dominant type of
main memory in the near future. They promise byteaddressability, good read latencies, and …

Scheduling is one of the factors that most directly affect performance in Thread-Level
Speculation (TLS). Since loops may present dependences that cannot be predicted before …

Loops are a rich source of parallelism. Unfortunately, many loops cannot be safely
parallelized at compile time because the compiler is not able to guarantee that there will be …

En los últimos años el término Big Data aparece a menudo asociado a una gran cantidad
de disciplinas, medicina, deporte, economía, aprendizaje, etc. Realmente,¿ sabemos que …

Multicore machines are becoming more and more common. Ideally, all applications benefit
from these advances in computer architecture. A complex challenge in parallel computing is …

Hoy en día es cada vez más fácil tener acceso a un supercomputador. Sin embargo sólo los
programadores expertos, con un elevado conocimiento del problema a paralelizar y de la …