可重构结构设计空间快速搜索方法

季爱明; 沈海斌; 严晓浪

可重构结构设计空间快速搜索方法

计量
- 文章访问数: 2355
- HTML全文浏览量: 161
- PDF下载量: 921
- 被引次数: 0
出版历程
- 收稿日期: 2004-12-31
- 修回日期: 2005-08-08
- 刊出日期: 2006-09-19

A Fast Method for Reconfigurable Architecture Design Space Exploration

摘要

摘要: 在可重构结构评估模型的基础上，研究了在算法级估计可重构结构的面积、性能和功耗的方法。根据面积、性能和功耗，分两步搜索可重构结构的设计空间。首先，搜索结构域中每个结构实现所有算法时的最小代价，其次，在结构设计空间中搜索最优结构。该方法不依赖任何具体的架构，全面评价可重构结构的优劣，能快速获得全局最优的搜索结果。应用实例表明，在可重构结构设计初期，该方法能有效地指导可重构结构的设计。
- 可重构结构;设计空间搜索;算法级;评估模型
Abstract: Based on evaluation model, approach to estimating ATP(Area Timing and Power) of RA(Reconfigurable Architecture) at algorithm level is studied. According to ATP, RA design space exploration is carried out in two stages. First,the lowest cost for each architecture to implement all algorithms is searched; second, the optimized architecture is explored in RA design space. This method is independent on any architecture. It can value RA roundly, and fast produce a global optimal result. Application example has shown that it is effectively to guide RA design at an early stage.

HTML全文

参考文献(1)

Rose J A, El Gamal A, Sangiovannt-Vincenteli A. Architecture of field programmable gate arrays[J].Proc. IEEE.1993, 81(7):1013-1029[2]Hartenstein R, Hofmann T H, Nageldinger U. Design-space exploration of low power coarse grained reconfigurable datapath array architectures. Proc. of Integrated Circuit Design, Power and Timing Modeling, Optimization and Simulation, 10th International Workshop. Gottingen, Germany, 2000: 118-128.[3]Hartenstein R. A decade of reconfigurable computing: a visionary retrospective. Proceedings of Conference on Design, Automation and Test in Europe. Munich, Germany, 2001: 642- 649.[4]Hartenstein R , Herz M , Hofmann T, et al.. KressArray Xplorer：a new CAD environment to optimize reconfigurable datapath array architectures. Proceedings of the ASP-DAC 2000, Yokohama , Japan, 2000: 163-168.[5]Betz V, Rose J, Marquart A. Architecture and CAD for Deep Submicron FPGAs. Dordrecht: Kluwer Academic Publishers, 1999: 50-61.[6]Bossuet L, Gogniat G, Philippe J L. Fast design spaceexploration method for reconfigurable architectures. Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms, Las Vegas, CSREA, 2003.[7]Darnauer J, Dai W W. A method for generation random circuits and its application to routability measurement. Proc of International Conference on Symp. Field Programmable Gate Arrays, 1996: 66-72.[8]Davis J A, De V K, Meundl J D. A stochastic wire-length distribution for GigaScale Integration (GSI)Part I: Derivation and validation[J].IEEE Trans. on Electron Devices.1998, 45(3):580-589[9]Kahng A B, Mantik S, Stroobandt D. Toward accurate models of achievable routing[J].IEEE Trans. on Computer Aided Design of Intergrated Circuits and System.2001, 20(5):648-658[10]Bossuet L .[J].Wayne B , Guy G, et al.. Targeting tiled architectures in design exploration. Proc of the International Parallel and Distributed Processing Symposium (IPDPS03). Austin : IEEE Computer Society.2003,:-[11]Landman P. High-level power estimation. Low Power Electronics and Design, 1996., International Symposium on Monterey CA, 1996：29-35.

施引文献

资源附件(0)

访问统计