By Topic

Meseta: a new scheduling strategy for speculative parallelization of randomized incremental algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Llanos, D.R. ; Departamento de Informatica, Univ. de Valladolid, Spain ; Orden, D. ; Palop, B.

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.

Published in:

Parallel Processing, 2005. ICPP 2005 Workshops. International Conference Workshops on

Date of Conference:

14-17 June 2005