Dynamically Reconfigurable Systems

TL;DR: The proposed scalable BRAM memory management architecture adaptively manages these dynamic memory requirements and balances the buffer memory over several PEs to reduce the total memory required, compared to the worst-case memory footprint for all PEs.

TL;DR: This paper proposes to integrate non-volatile resistive memories in the configuration cells and registers in order to instantly restore the FPGA context and shows that if the circuit is in the ‘ON’ state for less than 42% of time, non-Volatile FPGa starts saving energy compared to classical FPGAs.

TL;DR: The FASTER project will facilitate the use of reconfigurable technology by providing a complete methodology that enables designers to easily specify, analyse, implement and verify applications on platforms with general-purpose processors and acceleration modules implemented in the latest reconfigured technology.

TL;DR: This research presents a meta-modelling architecture that automates the very labor-intensive and therefore time-heavy and therefore expensive process of designing and integrating embedded systems to manage and manage distributed systems.

TL;DR: In this article, the authors propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules and with inhomogeneities found in commonly used FPGAs.

TL;DR: This chapter will present the ReCoNets approach for increasing reliability and flexibility of automotive, avionic or body-area networks by solving the hardware/software codesign problem online.

TL;DR: This work presents integer linear programming (ILP) formulations that address the problem of communication-aware module placement in array-like reconfigurable environments, such as the Erlangen Slot Machine.

TL;DR: In this article, an online and an offline component for the defragmentation of the available space is proposed, where the sequence of modules to be loaded on the FPGA is unknown beforehand.