Skip to Main content Skip to Navigation
Conference papers

Semantic information based speculative parallel execution

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Ist Rennes Connect in order to contact the contributor
Submitted on : Tuesday, June 22, 2010 - 3:56:25 PM
Last modification on : Thursday, June 18, 2020 - 10:18:03 AM
Long-term archiving on: : Friday, September 24, 2010 - 5:50:37 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads