Placement and Routing for 3D-FPGAs Using Reinforcement Learning and Support Vector Machines

  • Authors:

  • R. Manimegalai;E. Siva Soumya;V. Muralidharan;B. Ravindran;V. Kamakoti;D. Bhatia

  • Affiliations:

  • Indian Institute of Technology-Madras;Indian Institute of Technology-Madras;Indian Institute of Technology-Madras;Indian Institute of Technology-Madras;Indian Institute of Technology-Madras;University of Texas at Dallas

  • Venue:
  • VLSID '05 Proceedings of the 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The primary advantage of using 3D-FPGA over 2D-FPGA is that the vertical stacking of active layers reduce the Manhattan distance between the components in 3D-FPGA than when placed on 2D-FPGA. This results in a considerable reduction in total interconnect length. Reduced wire length eventually leads to reduction in delay and hence improved performance and speed. Design of anefficient placement and routing algorithm for 3D-FPGA that fully exploits the above mentioned advantage is a problem of deep research and commercial interest. In this paper, an efficient placement and routing algorithm is proposed for 3D-FPGAs which yields better results in terms of total interconnect length and channel-width. The proposed algorithm employs two important techniques, namely, Reinforcement Learning (RL) and Support Vector Machines (SVMs), to perform the placement. The proposed algorithm is implemented and tested on standard benchmark circuits and the results obtained are encouraging. This is one of the very few instances where reinforcement learning is used for solving a problem in the area of VLSI.