Placement des tâches matérielles de tailles variables sur des architectures reconfigurables dynamiquement et partiellement

Abstract : Adaptive systems based on Field-Programmable Gate Arrays (FPGA) architectures can benefit greatly from the high degree of flexibility offered by dynamic partial reconfiguration (DPR). Thanks to DPR, hardware tasks composing an adaptive system can be allocated and relocated on demand or depending on the dynamically changing environment. Existing design flows and commercial tools have evolved to meet the requirements of reconfigurables architectures, but that are limited in functionality. These tools do not allow an efficient placement and relocation of variable-sized hardware tasks. The main objective of this thesis is to propose a new methodology and a new approaches to facilitate to the designers the design phase of an adaptive and reconfigurable system and to make it operational, valid, optimized and adapted to dynamic changes in the environment. The first contribution of this thesis deals with the issues of relocation of variable-sized hardware tasks. A design methodology is proposed to address a major problem of relocation mechanisms: storing a single configuration bitstream to reduce memory requirements and increasing the reusability of generating hardware modules. A reconfigurable region partitioning technique is applied in this proposed relocation methodology to increase the efficiency of use of hardware resources in the case of reconfigurable tasks of variable sizes. This methodology also takes into account communication between different reconfigurable regions and the static region. To validate the design method, several cases studies are implemented. This validation shows an efficient use of hardware resources and a significant reduction in reconfiguration time. The second part of this thesis presents and details a mathematical formulations in order to automate the floorplanning of the reconfigurable regions in the FPGAs. The algorithms presented in this thesis are based on the optimization technique MILP (mixed integer linear programming). These algorithms allow to define automatically the location, the size and the shape of the dynamic reconfigurable region. We are mainly interested in this research to satisfy the constraints of placement of the reconfigurable zones and those related to the relocation. In addition, we consider the optimization of the hardware resources in the FPGA taking into account the tasks of variable sizes. Finally, an evaluation of the proposed approach is presented
Complete list of metadatas

https://hal.univ-lorraine.fr/tel-01909371
Contributor : Thèses Ul <>
Submitted on : Tuesday, January 8, 2019 - 12:38:37 PM
Last modification on : Wednesday, September 4, 2019 - 2:06:04 PM
Long-term archiving on: Tuesday, April 9, 2019 - 5:11:02 PM

File

DDOC_T_2017_0297_HANNACHI.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : tel-01909371, version 1

Citation

Marwa Hannachi. Placement des tâches matérielles de tailles variables sur des architectures reconfigurables dynamiquement et partiellement. Electronique. Université de Lorraine; Université de Monastir (Tunisie), 2017. Français. ⟨NNT : 2017LORR0297⟩. ⟨tel-01909371⟩

Share

Metrics

Record views

65

Files downloads

120