Por favor, use este identificador para citar o enlazar este ítem:http://uvadoc.uva.es/handle/10324/29117
Moody Scheduling for Speculative Parallelization
Año del Documento
Euro-Par 2015, 24-28 August, Vienna, Austria
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 runtime, Finding a good chunk size is not a simple task. The most used mechanism, Fixed-Size Chunking (FSC), requires many \dry-runs" to set the optimal chunk size. If the loop does not present dependence violations at runtime, scheduling only needs to deal with load balancing issues. For loops where the general pattern of dependences is known, as is the case with Randomized Incremental Algorithms, specialized mechanisms have been designed to maximize performance. To make TLS available to a wider community, a general scheduling algorithm that does not require a-priori knowledge of the expected pattern of dependences nor previous dry-runs to adjust any parameter is needed. In this paper, we present an algorithm that estimates at runtime the best size of the next chunk to be scheduled. This algorithm takes advantage of our previous knowledge in the design and test of other scheduling mechanisms, and it has a solid mathematical basis. The result is a method that, using information of the execution of the previous chunks, decides the size of the next chunk to be scheduled. Our experimental results show that the use of the proposed scheduling function compares or even increases the performance that can be obtained by FSC, greatly reducing the need of a a costly and careful search for the best fixed chunk size.
Castilla-Leon (VA172A12- 2), MICINN (Spain) and the European Union FEDER (MOGECOPP project TIN2011-25639, HomProg-HetSys project, TIN2014-58876-P, CAPAP-H5 net- work TIN2014-53522-REDT), Madrid Regional Government through the TIGRE5- CM program (S2013/ICE-2919), and by the MICINN Project MTM2011-22792. Belen Palop is partially supported by MINECO MTM2012-30951.
Version del Editor
Propietario de los Derechos
Except where otherwise noted, this item's license is described as Attribution 4.0 International