Efficient High Level Synthesis Exploration Methodology Combining Exhaustive and Gradient-Based Pruned Searching

This paper presents a methodology for fast and efficient Design Space Exploration during High Level Synthesis. An augmented instance of the design space is studied taking under consideration the effects of both compiler- and architectural-level transformations onto the final datapath. A new gradient-based pruning technique has been developed, which evaluates large portions of the augmented solution space in a quick manner. At a second level, the proposed pruning technique is combined with exhaustive exploration in order to guarantee the quality of design solutions. We show that the proposed methodology delivers (i) higher quality designs than exploration methods which do not account the introduced extended design space, (ii) with considerable reductions of the exploration’s runtime and (iii) efficient convergence to global optima.

[1]  Robert A. Walker,et al.  Efficiently searching the optimal design space , 1999, Proceedings Ninth Great Lakes Symposium on VLSI.

[2]  Peter Marwedel,et al.  Integrated Scheduling and Binding : A Synthesis Approach for Design Space Exploration , 1989, 26th ACM/IEEE Design Automation Conference.

[3]  Wolfgang Rosenstiel,et al.  A methodology and tool for automated transformational high-level design space exploration , 2000, Proceedings 2000 International Conference on Computer Design.

[4]  Preeti Ranjan Panda,et al.  The Impact of Loop Unrolling on Controller Delay in High Level Synthesis , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[5]  Ranga Vemuri,et al.  Distributed design-space exploration for high-level synthesis systems , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[6]  Robert A. Walker,et al.  A solution methodology for exact design space exploration in a three-dimensional design space , 1997, IEEE Trans. Very Large Scale Integr. Syst..

[7]  Stephan Wong,et al.  Optimal Unroll Factor for Reconfigurable Architectures , 2008, ARC.

[8]  Giovanni De Micheli,et al.  Synthesis and Optimization of Digital Circuits , 1994 .

[9]  H. Fawcett Manual of Political Economy , 1995 .

[10]  Miodrag Potkonjak,et al.  Performance optimization using template mapping for datapath-intensive high-level synthesis , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Matthias Gries,et al.  Methods for evaluating and covering the design space during early design development , 2004, Integr..

[12]  Peter Marwedel,et al.  Built-in chaining: introducing complex components into architectural synthesis , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[13]  Kiamal Z. Pekmestzi,et al.  Designing efficient DSP datapaths through compiler-in-the-loop exploration methodology , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[14]  Vilfredo Pareto,et al.  Manuale di economia politica , 1965 .

[15]  Nikil D. Dutt,et al.  Coordinated parallelizing compiler optimizations and high-level synthesis , 2004, TODE.

[16]  Gang Wang,et al.  Exploring time/resource trade-offs by solving dual scheduling problems with the ant colony optimization , 2007, TODE.

[17]  Philippe Coussy,et al.  High-Level Synthesis: from Algorithm to Digital Circuit , 2008 .