TY - GEN
T1 - Partial bitstream 2-D core relocation for reconfigurable architectures
AU - Rossmeissl, Chad
AU - Sreeramareddy, Adarsha
AU - Akoglu, Ali
PY - 2009
Y1 - 2009
N2 - Field Programmable Gate Arrays (FPGAs) potentially offer enhanced reliability, recovery from failures through partial and dynamic reconfigurations, and eliminate the need for redundant hardware typically used in faulttolerant systems. Our earlier work on scalable self-configurable architectures for reusable space systems (SCARS) describes a partial reconfiguration based self-healing architecture. The implementation of this architecture with the currently available industry tools has taught us a few valuable lessons. Generating the partially reconfigurable cores has acute restrictions that limit our ability to relocate the cores to other regions of the FPGA leading to poor area utilization. State of the art relocation approaches in the academia employ complex relocation management mechanisms which prohibit these solutions to operate at run time. In this paper, we propose a methodology for run-time 2-D core relocation to overcome the above issues. We show that our approach increases reconfiguration area utilization by 36% and reduces partial bitstream storage memory usage by 91% when compared to our base implementation. Conventional solutions restrict a given functionality to be partially reconfigured in a predetermined area. This technology enables the designer to move any core to anywhere on the FPGA fabric providing more resource availability when recovering from failure.
AB - Field Programmable Gate Arrays (FPGAs) potentially offer enhanced reliability, recovery from failures through partial and dynamic reconfigurations, and eliminate the need for redundant hardware typically used in faulttolerant systems. Our earlier work on scalable self-configurable architectures for reusable space systems (SCARS) describes a partial reconfiguration based self-healing architecture. The implementation of this architecture with the currently available industry tools has taught us a few valuable lessons. Generating the partially reconfigurable cores has acute restrictions that limit our ability to relocate the cores to other regions of the FPGA leading to poor area utilization. State of the art relocation approaches in the academia employ complex relocation management mechanisms which prohibit these solutions to operate at run time. In this paper, we propose a methodology for run-time 2-D core relocation to overcome the above issues. We show that our approach increases reconfiguration area utilization by 36% and reduces partial bitstream storage memory usage by 91% when compared to our base implementation. Conventional solutions restrict a given functionality to be partially reconfigured in a predetermined area. This technology enables the designer to move any core to anywhere on the FPGA fabric providing more resource availability when recovering from failure.
UR - http://www.scopus.com/inward/record.url?scp=72849114556&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=72849114556&partnerID=8YFLogxK
U2 - 10.1109/AHS.2009.41
DO - 10.1109/AHS.2009.41
M3 - Conference contribution
AN - SCOPUS:72849114556
SN - 9780769537146
T3 - Proceedings - 2009 NASA/ESA Conference on Adaptive Hardware and Systems, AHS 2009
SP - 98
EP - 105
BT - Proceedings - 2009 NASA/ESA Conference on Adaptive Hardware and Systems, AHS 2009
T2 - 2009 NASA/ESA Conference on Adaptive Hardware and Systems, AHS 2009
Y2 - 29 July 2009 through 1 August 2009
ER -