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.
Type de document :
Communication dans un congrès
First International Workshop on Polyhedral Compilation Techniques, IMPACT 2011, in conjunction with CGO 2011, Apr 2011, Chamonix, France. 2011
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00572797
Contributeur : Philippe Clauss <>
Soumis le : jeudi 28 juillet 2011 - 11:30:43
Dernière modification le : vendredi 12 janvier 2018 - 01:11:37
Document(s) archivé(s) le : lundi 12 novembre 2012 - 15:05:49

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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, Apr 2011, Chamonix, France. 2011. 〈inria-00572797〉

Partager

Métriques

Consultations de la notice

366

Téléchargements de fichiers

170