Optimisations Techniques for the Automatic ISA Customisation Algorithm

Antoine TROUVE  Kazuaki MURAKAMI  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E95-D   No.2   pp.437-440
Publication Date: 2012/02/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E95.D.437
Print ISSN: 0916-8532
Type of Manuscript: Special Section LETTER (Special Section on Reconfigurable Systems)
Category: Design Optimisation
Keyword: 
reconfigurable computing,  custom instruction generation,  optimisation,  

Full Text: PDF(164.7KB)>>
Buy this Article

 | Errata[Uploaded on February 1,2012]


Summary: 
This article introduces some improvements to the already proposed custom instruction candidates selection for the automatic ISA customisation problem targeting reconfigurable processors. It introduces new opportunities to prune the search space, and a technique based on dynamic programming to check the independence between groups. The proposed new algorithm yields one order less measured number of convexity checks than the related work for the same inputs and outputs.