A Route System Based on Genetic Algorithm for Coarse-Grain Reconfigurable Architecture

被引：0

作者：

Guo, Yan ^{[1
]}

Zeng, Sanyou ^{[1
]}

Kang, Lishan ^{[1
]}

Liu, Gang ^{[1
]}

Hu, Nannan ^{[1
]}

Zhao, Kuo ^{[2
]}

机构：

[1] China Univ Geosci, Sch Comp, Wuhan 430074, Peoples R China

[2] Hebei Youth Adm Cadres Coll, Shijiazhuang 050031, Hebei, Peoples R China

来源：

ADVANCES IN COMPUTATION AND INTELLIGENCE, PROCEEDINGS | 2009年 / 5821卷

关键词：

Coarse-grain reconfigurable architecture; resources-constrained multi-pair shortest path problem in directed graphs; Genetic algorithm; Multi-pair path encoding;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

It is a often hard to find a feasible and optimum route because the routing resources are constrained in coarse-grain RA (CGRA) and several functions are often defined in same one element of RA. In this paper, a proposed propriety-based path encoding genetic algorithm is applied for the routing problem of CGRA. By mapping Fast Fourier Transform of the butterfly computation to CTaiJi that is a newly developed CGRA, the proposed GA shows good ability to find the good solution.

引用

页码：11 / +

页数：2