Computing Reviews

Genetic-algorithm-based FPGA architectural exploration using analytical models
Mehri H., Alizadeh B. ACM Transactions on Design Automation of Electronic Systems22(1):1-17,2016.Type:Article
Date Reviewed: 11/09/16

Mehri and Alizadeh use the genetic algorithm (GA) to optimize field-programmable gate array (FPGA) architectural performance involving area, delay, and power consumption. Compared with the traditional geometric programming (GP) algorithm that requires the sweeping of parameters such as look-up table (LUT) size and configurable logic block (CLB) number to find the optimal values, the GA algorithm can (1) explore the FPGA architecture and optimize the parameters concurrently and (2) find these parameters two orders of magnitude faster than the GP framework. Although the GA algorithm has been applied in some physical designs, such as placement and routing of FPGAs, this is the first usage in FPGA architectural analysis. In addition, some performance metrics are also formulated and summarized in this paper, such as the area and delay models from Smith et al. [1], and the power models from Mehri and Alizadeh [2] that are referred to by the proposed algorithm. All of these models are very useful in abstract-level performance analysis, particularly at the beginning of some complex projects.


1)

Smith, A. M.; Constantinides, G. A.; Cheung, P. FPGA architecture optimization using geometric programming. IEEE Trans. CAD IC Syst. 29, 8(2010), 1163–1176.


2)

Mehri, H.; Alizadeh, B. An analytical dynamic and leakage power model for FPGAs. In Proc. of the 22nd Iranian Conference on Electrical Engineering (ICEE '14). IEEE, 2014, 300–305.

Reviewer:  Xiaokun Yang Review #: CR144907 (1703-0181)

Reproduction in whole or in part without permission is prohibited.   Copyright 2024 ComputingReviews.com™
Terms of Use
| Privacy Policy