Transparent Parallelization of Binary Code - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Transparent Parallelization of Binary Code


This paper describes a system that applies automatic parallelization techniques to binary code. The system works by raising raw executable code to an intermediate representation that exhibits all memory accesses and relevant register definitions, but outlines detailed computations that are not relevant for parallelization. It then uses an off-the-shelf polyhedral parallelizer, first applying appropriate enabling transformations if necessary. The last phase lowers the internal representation into a new executable fragment, re-injecting low-level instructions into the transformed code. The system is shown to leverage the power of polyhedral parallelization techniques in the absence of source code, with performance approaching those of source-to-source tools.
Fichier principal
Vignette du fichier
paper.pdf (106.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00572797 , version 1 (28-07-2011)


  • HAL Id : inria-00572797 , version 1


Benoit Pradelle, Alain Ketterlin, Philippe Clauss. Transparent Parallelization of Binary Code. First International Workshop on Polyhedral Compilation Techniques, IMPACT 2011, in conjunction with CGO 2011, Christophe Alias, Cédric Bastoul, Apr 2011, Chamonix, France. ⟨inria-00572797⟩


211 View
117 Download


Gmail Facebook X LinkedIn More