RT info:eu-repo/semantics/conferenceObject
T1 Meseta: A new scheduling strategy for speculative parallelization of randomized incremental algorithms
A1 Llanos Ferraris, Diego Rafael
A1 Orden, David
A1 Palop del Río, Belén
K1 Informática
K1 1203 Ciencia de Los Ordenadores
K1 3304 Tecnología de Los Ordenadores
AB In this work the authors addressed the problem of scheduling loops with dependencies in the context of speculative parallelization. It is shown that scheduling alternatives are highly influenced by the dependence violation pattern presented in the code. The analysis was centered in those algorithms where dependencies are less likely to appear as the execution proceeds, like incremental randomized algorithms. These algorithms are, in general, hard to parallelize by hand, and represent a challenge for any automatic parallelization scheme. The analysis led to the development of Meseta, a new scheduling strategy that takes into account the probability of a dependence violation to determine the number of iterations being scheduled. Meseta is compared, among others, with fixed-size chunking (FSC), the only scheduling alternative used so far in the context of speculative parallelization. The experimental results showed a 3% to 22% speedup improvement over FSC for the same incremental randomized algorithm.
PB IEEE
YR 2005
FD 2005
LK https://uvadoc.uva.es/handle/10324/70865
UL https://uvadoc.uva.es/handle/10324/70865
LA eng
NO 2005 ICPP Workshops (HPSEC-05, 7th Workshop on High Performance Scientific and Engineering Computing), Norway, 14-17 June 2005
NO Producción Científica
DS UVaDOC
RD 22-nov-2024