Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hartenstein, R.: A Decade of Reconfigurable Computing: a Visionary Retrospective. In: DATE 2001, Int’l Conference on Design Automation and Testing in Europe - and Exhibit, Munich, Germany, March 12-15 (2001)
(2005-7-11), http://www.pactcorp.com
Kamalizad, A.H., Pan, C., Bagherzadeh, N.: Fast Parallel FFT on a Reconfigurable Computation Platform. In: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2003) (2003)
Yeung, A.K.W., Rabaey, J.M.: A Reconfigurable Data-driven Multi-Processor Architecture for Rapid Prototyping of High Throughput DSP Algorithms. In: Proc. ICASSP 1997, Munich, Germany (April 1997)
Liguo, S., Yuxian, J.: CTaiJi——a new coarse grain re-configurable computing platform. Microelectronics and computer (September 2005)
Lee, C.Y.: An Algorithm for Path Connections and Its Applications. IRE Trans. On Electronic Computers EC-10, 346–365 (1961)
Dees, W., Smith, R.: Performance of Interconnection Rip-Up and Reroute Strategies. In: Proc. 18th Design Automation Conference, June 1981, pp. 382–390 (1981)
Hill, D.: A CAD System for the Design of Field Programmable Gate Arrays. In: Proc. 28th Design Automation Conference, June 1991, pp. 187–192 (1991)
Linsker, R.: An Iterative-Improvement Penalty-Function-Driven Wire Routing System. IBM Journal of Research and Development 28, 613–624 (1984)
McMurchie, L., Ebeling, C.: PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs
Shiyong, L.: Ant colony and its application. Published by HaErBin University of Industrial (2004)
(2005-7-11), http://www.inst.eecs.berkeley.edu/~cs150/sp05/Lab/Lab1.PDF
Brown, S., Rose, J., Vranesic, Z.: A Detailed Router for Field-Programmable Gate Arrays. IEEE Transactions on Computer-Aided Design 11(5), 620–628 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li-Guo, S., Yu-Xian, J. (2006). A Route System Based on Ant Colony for Coarse-Grain Reconfigurable Architecture. In: Jiao, L., Wang, L., Gao, X., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881223_27
Download citation
DOI: https://doi.org/10.1007/11881223_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45907-1
Online ISBN: 978-3-540-45909-5
eBook Packages: Computer ScienceComputer Science (R0)