A runtime relocation based workflow for self dynamic reconfigurable systems design
Name
Santambrogio-2009-A runtime relocation based workflow for self dynamic reconfigurable systems design.pdf
Size
1004.61 KB
Format
Adobe PDF
Checksum (MD5)
0a2a59ba9ded1fffc83cf336ca655ed5
Author(s)
Santambrogio, Marco Domenico
Morandi, M.
Novati, M.
Sciuto, D.
Date Issued
September 2009
Journal
International Conference on Field Programmable Logic and Applications, 2009. FPL 2009.
Publisher
Institute of Electrical and Electronics Engineers
Citation
Santambrogio, M.D. et al. “A runtime relocation based workflow for self dynamic reconfigurable systems design.” Field Programmable Logic and Applications, 2009. FPL 2009. International Conference on. 2009. 86-91. © Copyright 2009IEEE
Version
Final published version
Abstract
A self, partial and dynamic approach to reconfiguration makes it possible to obtain higher flexibility and better performance with respect to simpler approaches; however, the price for this improvement lies in the increased difficulties in the reconfigurable system creation and management, which become significantly more complex. An automated or semiautomated way to support this kind of systems would simplify the problem by raising the level of abstraction at which the designer has to operate. The aim of this work is the creation of a complete workflow to help the designer in the creation and management of self partially and dynamically reconfigurable systems: the designer should only specify the application, the reconfigurable device, the reconfiguration model (1D vs 2D) and the type of communication infrastructure, and the automated flow will deal with the subsequent steps down to the final architecture implementation. Among other aspects, the provided support includes the definition of area constraint for cores, the creation of an efficient runtime solution for core allocation management and the generation of a solution to obtain internal and fast relocation of cores.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/FPL.2009.5272545
