Semantic information based speculative parallel execution - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Semantic information based speculative parallel execution

András Vajda
  • Function : Author
  • PersonId : 872466


As the number of cores within one processor will continue to increase, while per-core frequency is likely to stagnate, speculative execution in general and data value prediction in particular, will once again be a prime candidate for speeding up execution of applications with limited inherent parallelism. In order to succeed however, we need to improve the semantic information the applications will be able to provide to the hardware; in this paper we present initial results based on using formal contracts to convey such information to the run-time environment in order to guide the type and scope of speculative execution. Experiments with an application that is traditionally considered hard to parallelize – Huffman decoding – show the potential of such an approach, without the need to re-write the actual application. One of the strengths of this method is that it can make efficient use of large number of cores, opening a possible path for scaling applications with limited amount of parallelism on massively multi-core processors.
Fichier principal
Vignette du fichier
PESPMA-vajda.pdf (365.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00494293 , version 1 (22-06-2010)


  • HAL Id : inria-00494293 , version 1


András Vajda, Per Stenstrom. Semantic information based speculative parallel execution. Pespma 2010 - Workshop on Parallel Execution of Sequential Programs on Multi-core Architecture, Jun 2010, Saint Malo, France. ⟨inria-00494293⟩
105 View
153 Download


Gmail Facebook X LinkedIn More