Model‐driven physical‐design automation for FPGAs: fast prototyping and legacy reuse. (6th March 2013)

• Record Type: Journal Article
• Authors: Teodorov, Ciprian; Lagadec, Loïc; Plantec, A.; Lagadec, L.
• Is Part Of: Software, practice & experience. Volume 44:Number 4(2014)
• Page Start: 455
• Page End: 482
• Publication Date: 2013-03-06
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2190
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2190-abs-0001"> <title>SUMMARY</title> <p>The current integrated circuit technologies are approaching their physical limits in terms of scaling and power consumption, in this context, the electronic design automation (EDA) industry is pushed towards solving ever more challenging problems in terms of performance, scalability and adaptability. Meeting these constraints needs innovation at both the algorithmic and the methodological level. Amongst academic EDA tools, Madeo toolkit has been targeting field‐programmable gate array (FPGA) design‐automation at the logic and the physical level since the late 1990s. As many other long‐living software, despite embedding valuable legacy, Madeo exhibits unwanted characteristics that penalize evolution and render the automation problems even more difficult. This study presents a methodological approach to physical‐design automation relying on model‐driven engineering, which is illustrated through the incremental redesign of the Madeo framework. A benefit of this approach is the emergence of a common vocabulary to describe the EDA domain in an FPGA scope. A second advantage is the isolation of the optimization algorithms from the structural domain models. However, the main asset is the possibility to re‐inject into the newly designed toolkit most of the legacy code. The redesigned framework is compared with and scored against initial code‐base, and demonstrates a regression‐free remodeling of the environment with net improvements in terms of size and complexity metrics. As a consequence, the evolution capability is back on stage, and the domain‐space exploration widens to the algorithmic axis. Copyright © 2013 John Wiley & Sons, Ltd.</p> </abstract>