Sequential decomposition of operations and compilers optimization

Mumtaz Ahmad 1, * Serge Burckel 1 Adam Cichon 2
* Auteur correspondant
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies, INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Code optimization is an important area of research that has remarkable contributions in addressing the challenges of information technology. It has introduced a new trend in hardware as well as in software. Efforts that have been made in this context led to introduce a new foundation, both for compilers and processors. In this report we study different techniques used for sequential decomposition of mappings without using extra variables. We focus on finding and improving these techniques of computations. Especially, we are interested in developing methods and efficient heuristic algorithms to find the decompositions and implementing these methods in particular cases. We want to implement these methods in a compiler with an aim of optimizing code in machine language. It is always possible to calculate an operation related to K registers by a sequence of assignments using only these K registers. We verified the results and introduced new methods. We described In Situ computation of linear mapping by a sequence of linear assignments over the set of integers and investigated bound for the algorithm. We introduced a method for the case of boolean bijective mappings via algebraic operations over polynomials in GF(2). We implemented these methods using Maple
Type de document :
[Research Report] RR-7076, INRIA. 2009, pp.91
Liste complète des métadonnées

Littérature citée [58 références]  Voir  Masquer  Télécharger
Contributeur : Mumtaz Ahmad <>
Soumis le : jeudi 29 octobre 2009 - 16:30:11
Dernière modification le : jeudi 11 janvier 2018 - 06:20:00
Document(s) archivé(s) le : mardi 16 octobre 2012 - 13:00:49


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00428722, version 1


Mumtaz Ahmad, Serge Burckel, Adam Cichon. Sequential decomposition of operations and compilers optimization. [Research Report] RR-7076, INRIA. 2009, pp.91. 〈inria-00428722〉



Consultations de la notice


Téléchargements de fichiers