Systematic architecture exploration based on optimistic cycle estimation for low energy embedded processors

Systematic architecture exploration from vast solution space is a complex problem in embedded system design. It is very difficult to explore a best architecture fast and accurately because accurate evaluation usually consumes significant amount of time for point in the solution space. In this paper, we propose fast and systematic architecture exploration method for address generation unit (AGU) based on a coarse grained reconfigurable architecture model. First we prove that a set of Pareto solutions of cycle vs energy becomes a subset of Pareto solutions of cycle vs area under some practical assumptions. In addition we propose “Optimistic cycle (OC)” metric to find out promising solutions from vast solution space. Based on this metric we also propose a fast architecture exploration algorithm which only applies mapping to promising architectures. Using the proposed systematic architecture exploration method, we show that we can obtain almost the same trade-off points as the exhaustive search method and also that our method is about 164 times faster than exhaustive search.

[1]  Hugo De Man,et al.  High-level address optimization and synthesis techniques for data-transfer-intensive applications , 1998, IEEE Trans. Very Large Scale Integr. Syst..

[2]  Gustavo de Veciana,et al.  Application-specific clustered VLIW datapaths: early exploration on a parameterized design space , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Ahmed Amine Jerraya,et al.  Address calculation for retargetable compilation and exploration of instruction-set architectures , 1996, DAC '96.

[4]  F. Catthoor,et al.  Analysis of high-level address code transformations for programmable processors , 2000, Proceedings Design, Automation and Test in Europe Conference and Exhibition 2000 (Cat. No. PR00537).

[5]  Rainer Leupers,et al.  Retargetable Code Generation for Digital Signal Processors , 1997, Springer US.

[6]  Francky Catthoor,et al.  Systematic address and control code transformations for performance optimisation of a MPEG-4 video decoder , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.

[7]  Rainer Leupers,et al.  Register-constrained address computation in DSP programs , 1998, Proceedings Design, Automation and Test in Europe.

[8]  Srinivas Devadas,et al.  Analysis and Evaluation of Address Arithmetic Capabilities in Custom DSP Architectures , 1999, Des. Autom. Embed. Syst..

[9]  Greg Snider,et al.  Spacewalker: Automated Design Space Exploration for Embedded Computer Systems , 2001 .

[10]  Aviral Shrivastava,et al.  Automatic Design Space Exploration of Register Bypasses in Embedded Processors , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[11]  Hugo De Man,et al.  Architectural exploration and optimization for counter based hardware address generation , 1997, Proceedings European Design and Test Conference. ED & TC 97.

[12]  Francky Catthoor,et al.  Address Generation Optimization for Embedded High-Performance Processors: A Survey , 2008, J. Signal Process. Syst..

[13]  D. Verkest,et al.  Systematic high-level address code transformations for piece-wise linear indexing: illustration on a medical imaging algorithm , 2000, 2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528).

[14]  Rainer Leupers,et al.  Algorithms for address assignment in DSP code generation , 1996, Proceedings of International Conference on Computer Aided Design.

[15]  Al Davis,et al.  A loop accelerator for low power embedded VLIW processors , 2004, CODES+ISSS '04.

[16]  Ittetsu Taniguchi,et al.  Dynamic Reconfigurable Architecture Exploration based on Parameterized Reconfigurable Processor Model , 2006, VLSI-SoC.