A CAD system for the design of field programmable gate arrays
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
A decade of reconfigurable computing: a visionary retrospective
Proceedings of the conference on Design, automation and test in Europe
Performance of interconnection rip-up and reroute strategies
DAC '81 Proceedings of the 18th Design Automation Conference
Fast Parallel FFT on a Reconfigurable Computation Platform
SBAC-PAD '03 Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing
An iterative-improvement penalty-function-driven wire routing system
IBM Journal of Research and Development
A Route System Based on Genetic Algorithm for Coarse-Grain Reconfigurable Architecture
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
| Hi-index | 0.00 |
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.