Skip to Main content Skip to Navigation

Sequential decomposition of operations and compilers optimization

Mumtaz Ahmad 1, * Serge Burckel 1 Adam Cichon 2
* Corresponding author
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 (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
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
Complete list of metadata

Cited literature [58 references]  Display  Hide  Download
Contributor : Mumtaz Ahmad Connect in order to contact the contributor
Submitted on : Thursday, October 29, 2009 - 4:30:11 PM
Last modification on : Saturday, October 16, 2021 - 11:26:06 AM
Long-term archiving on: : Tuesday, October 16, 2012 - 1:00:49 PM


Files produced by the author(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⟩



Record views


Files downloads