A route system based on ant colony for coarse-grain reconfigurable architecture

被引:0
作者
Song Li-Guo [1 ]
Jiang Yu-Xian
机构
[1] Beijing Univ Aeronaut & Astronaut, Dept Automat Control, Beijing 100083, Peoples R China
[2] Beijing Microelect Technol Inst, Beijing 1000760, Peoples R China
来源
ADVANCES IN NATURAL COMPUTATION, PT 2 | 2006年 / 4222卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
It is very important to design a good routing-system for the whole compile-synthesis system of reconfigurable architecture (RA). Because the routing resources of coarse-grain RA (CGRA) are less than those of fine-grain RA, and several functions are often defined in same one element of RA, it is difficult to find a good route. Therefore, it is more important for routing-algorithm of CGRA to have stronger ability of finding feasible and optimum path. In the paper, the improved max-min Ant System (MMAS) that added the ability of smell for ant is applied for the routing problem of CGRA. By several benchmarks on CTaiJi that is a new developed CGRA, The improved MMAS shows better ability to find the best solution than PathFinder that is often used now.
引用
收藏
页码:215 / 221
页数:7
相关论文
共 11 条
[1]   A DETAILED ROUTER FOR FIELD-PROGRAMMABLE GATE ARRAYS [J].
BROWN, S ;
ROSE, J ;
VRANESIC, ZG .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1992, 11 (05) :620-628
[2]  
DEES W, 1981, P 18 DES AUT C JUN, P382
[3]  
HARTENSTEIN RW, 2001, INT C DES AUT TEST E
[4]  
HILL DD, 1991, P 28 ACM IEEE DES AU, P187
[5]  
KAMALIZAD AH, 2003, P 15 S COMP ARCH HIG
[6]  
Lee C. Y., 1961, IRE Transac- tions on Electronic Computers, V10, P346, DOI 10.1109/TEC.1961.5219222
[7]  
LI SY, 2004, ANT COLONY ITS APPL
[8]  
LIGUO S, 2005, CTAIJI NEW COARSE GR
[10]  
Mcmurchie L., PATHFINDER NEGOTIATI