Advertisement

A Route System Based on Ant Colony for Coarse-Grain Reconfigurable Architecture

  • Song Li-Guo
  • Jiang Yu-Xian
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4222)

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.

Keywords

Connected Graph Field Programmable Gate Array Optimum Path Pheromone Trail Rout Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Liguo, S., Yuxian, J.: CTaiJi——a new coarse grain re-configurable computing platform. Microelectronics and computer (September 2005)Google Scholar
  6. 6.
    Lee, C.Y.: An Algorithm for Path Connections and Its Applications. IRE Trans. On Electronic Computers EC-10, 346–365 (1961)CrossRefGoogle Scholar
  7. 7.
    Dees, W., Smith, R.: Performance of Interconnection Rip-Up and Reroute Strategies. In: Proc. 18th Design Automation Conference, June 1981, pp. 382–390 (1981)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Linsker, R.: An Iterative-Improvement Penalty-Function-Driven Wire Routing System. IBM Journal of Research and Development 28, 613–624 (1984)CrossRefGoogle Scholar
  10. 10.
    McMurchie, L., Ebeling, C.: PathFinder: A Negotiation-Based Performance-Driven Router for FPGAsGoogle Scholar
  11. 11.
    Shiyong, L.: Ant colony and its application. Published by HaErBin University of Industrial (2004)Google Scholar
  12. 12.
  13. 13.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Song Li-Guo
    • 1
    • 2
  • Jiang Yu-Xian
    • 1
  1. 1.Department of Automatic ControlBeijing University of aeronautics and astronauticsBeijing
  2. 2.Beijing Microelectronics Technology InstituteBeijing

Personalised recommendations