Transparent Parallelization of Binary Code

Benoit Pradelle 1, 2 Alain Ketterlin 1, 2, 3 Philippe Clauss 1, 2, 3
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00572797
Contributor : Philippe Clauss <>
Submitted on : Thursday, July 28, 2011 - 11:30:43 AM
Last modification on : Friday, January 12, 2018 - 1:11:37 AM
Long-term archiving on : Monday, November 12, 2012 - 3:05:49 PM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00572797, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

376

Files downloads

176