共查询到18条相似文献,搜索用时 171 毫秒
1.
FPGA动态可重构理论及其研究进展 总被引:2,自引:1,他引:1
近年来,随着微电子技术和计算机技术的发展,尤其是大规模现场可编程门阵列FPGA的出现,实时电路重构技术逐渐成为国际学术界的研究热点;基于FPGA的重构系统具有自适应、自主修复特性,在空间应用中具有非常重要的作用;文章介绍了基于FP-GA动态可重构技术的原理、分类,重点讨论了动态可重构的实现方法及两种技术,并给出了系统重构设计的流程,同时,介绍了基于FPGA动态可重构技术已取得的成功应用,最后展望了FPGA动态可重构技术的发展前景,并指出了有待解决的问题. 相似文献
2.
基于模块的动态可重构系统设计 总被引:2,自引:0,他引:2
可重构计算是介于通用处理器和ASIC之间的全新计算解决方案,是一种即保留了硬件计算的速度性能,又兼具软件编程情况灵活性的算法实现方式.介绍了基于模块的动态可重构系统设计方法和模块间的通信方式.实现了基于单片Xilinx Virtex-Ⅱ Pro FPGA片上动态自重构系统,可在系统运行时以较短的时间开销灵活加载所需的重构功能模块,充分体现了可重构计算的性能与速度的优势. 相似文献
3.
4.
可重构技术在虚拟仪器中的应用 总被引:1,自引:0,他引:1
主要研究以可重构计算技术为基础的虚拟仪器实验系统,系统分为计算机、主控FPGA、可重构FPGA以及仪器端口驱动等部分,采用动态和静态相结合的方式,通过主FPGA选择不同的下载程序以实现对从FPGA的重构;设计计数器及函数发生器两个功能模块对虚拟系统的重构性能进行了验证。可随时更改实验功能,加速产品研发速度并降低产品成本。 相似文献
5.
6.
本文介绍了可重构计算技术的提出和历程,结合器件发展、重构方式和结构模式分析了基于FPGA的可重构计算技术原理,从设计、配置角度探讨了实现技术,并阐述了在多个领域的应用。根据存在的问题,提出了可重构计算技术的发展研究方向。 相似文献
7.
动态可重构技术能在一定控制逻辑的驱动下,对全部或部分逻辑资源实现在系统的动态功能变换和硬件的时分复用.本文介绍了可重构体系结构及典型动态可重构结构;详细分析、比较了动态可重构系统4种通信结构的主要性能,指出各自适用领域,并给出一个应用实例;最后探讨了动态可重构技术研究面临的相关问题和发展趋势. 相似文献
8.
可重构资源管理及硬件任务布局的算法研究 总被引:1,自引:0,他引:1
可重构系统具有微处理器的灵活性和接近于ASIC的计算速度,可重构硬件的动态部分重构能力能够实现计算和重构操作的重叠,使系统能够动态地改变运行任务,可重构资源管理和硬件任务布局方法是提高可重构系统性能的关键.提出了基于任务上边界计算最大空闲矩形的算法(TT-KAMER),能够有效地管理系统的空闲可重构资源;在此基础上使用FF和启发式BF算法进行硬件任务的布局.实验表明,算法能够有效地实现在线资源分配与任务布局,获得较高的资源利用率. 相似文献
9.
10.
可重构技术作为嵌入式系统中软硬件结合的设计方法,在可靠性、系统高集成度方面有很大优势。现场可编辑门
阵列(Field Programmable Gate Array,FPGA)不仅可以满足这些客观需求,还加强了系统的自适应性,降低了开发成本。
文章介绍了动态局部重构的实现方法,并在早期获取部分可重构(Early Access Partial Reconfiguration,EAPR)方法的基础
上加以改进。之后使用 Xilinx 生产的 Virtex-ML403 开发板实现整个设计,验证该方法的有效性,保证系统的稳定,在实
际应用的实现中有利于对资源有效的管理和合理的利用。 相似文献
11.
12.
近年来,随着可重构计算方法和可重构硬件特性的不断演进,基于FPGA动态部分重构技术构建运行时可重构加速器已经成为解决传统加速器设计中硬件资源限制问题的重要途径.然而,区别于传统静态重构加速器,FPGA的动态重构开销是影响硬件加速整体性能的重要因素,而目前尚缺少能够在可重构硬件设计的早期阶段进行动态重构开销精确估算的相关... 相似文献
13.
Claudio Brunelli Fabio Garzia Davide Rossi Jari Nurmi 《Journal of Systems Architecture》2010,56(1):38-47
Signal processors exploiting ASIC acceleration suffer from sky-rocketing manufacturing costs and long design cycles. FPGA-based systems provide a programmable alternative for exploiting computation parallelism, but the flexibility they provide is not as high as in processor-oriented architectures: HDL or C-to-HDL flows still require specific expertise and a hardware knowledge background. On the other hand, the large size of the configuration bitstream and the inherent complexity of FPGA devices make their dynamic reconfiguration not a very viable approach. Coarse-grained reconfigurable architectures (CGRAs) are an appealing solution but they pose implementation problems and tend to be application specific. This paper presents a scalable CGRA which eases the implementation of algorithms on field programmable gate array (FPGA) platforms. This design option is based on two levels of programmability: it takes advantage of performance and reliability provided by state-of-the-art FPGA technology, and at the same time it provides the user with flexibility, performance and ease of reconfiguration typical of standard CGRAs. The basic cell template provides advanced features such as sub-word SIMD integer and floating-point computation capabilities, as well as saturating arithmetic. Multiple reconfiguration contexts and partial run-time reconfiguration capabilities are provided, tackling this way the problem of high reconfiguration overhead typical of FPGAs. Selected instances of the proposed architecture have been implemented on an Altera Stratix II EP2S180 FPGA. On this system, we mapped some common DSP, image processing, 3D graphics and audio compression algorithms in order to validate our approach and to demonstrate its effectiveness by benchmarking the benefits achieved. 相似文献
14.
Lars Braun Diana Göhringer Thomas Perschke Volker Schatz Michael Hübner Jürgen Becker 《Journal of Real-Time Image Processing》2009,4(2):109-125
Fine grained reconfigurable architectures, like Xilinx field programmable gate arrays (FPGAs) provide a high flexibility through
runtime re-programming, called dynamic and partial reconfiguration. This feature allows for runtime adaptation of the system
architecture and behavior configured on the FPGA. The exploitation of this feature enables to load video image processing
algorithms on-demand in order to adapt the configuration in correspondence to the changing requirements of the application
depending on the image content. For high resolution sensor images, this novel computing paradigm can provide a huge benefit
in power reduction and performance gain for actual and future embedded electronic systems. This paper presents a two dimensional
system approach exploiting dynamic and partial reconfiguration in order to adapt the system architecture to the actual requirements
of image processing applications. The methodology of runtime reconfiguration can be exploited beneficially for highly adaptive
multiprocessor systems. Such systems, different from the traditional static approach for multi- and many-core architectures
have the advantage, for providing computational performance directly linked to the requirements of the application. The architecture
presented in this paper allows for adapting the processing elements as well as the communication infrastructure which is a
novel 2D switch-based Network-on-Chip. The presented approach follows and extends the actual trend in computer science of
using many- and multi-core processors for bridging the gap between required computation performance for future application
in the field of image processing.
相似文献
Jürgen BeckerEmail: |
15.
16.
17.
Miguel L. SilvaAuthor Vitae João Canas FerreiraAuthor Vitae 《Journal of Systems Architecture》2012,58(1):24-37
This paper presents and evaluates a method of generating partial bitstreams at run-time for dynamic reconfiguration of sections of an FPGA. The method is intended for use in adaptive embedded systems that employ run-time reconfiguration to achieve high flexibility and performance. The proposed approach combines partial bitstreams of coarse-grained components to produce a new partial bitstream implementing a given circuit netlist. Topological sorting of the netlist is used to determine the initial positions of individual components, whose placement is then improved by simulated annealing. Connection routing is done by a breadth-first search of the reconfigurable area based on a simplified resource model of the reconfigurable fabric. The desired partial bitstream is constructed by merging together the default bitstream of the reconfigurable area, the relocated partial bitstreams of the components, and the configurations of the switch matrices used for routing. The approach is embodied in a code library that applications can use to create new bitstreams at run-time. For the members of a set of 29 benchmarks (both synthetic and application-derived) having between five and 41 components, the complete process of bitstream generation takes between 8 s and 35 s when running on an embedded PowerPC 405 microprocessor clocked at 300 MHz. 相似文献