Architecture-Adaptive Routability-Driven Placement for FPGAs

Current FPGA placement algorithms estimate the routability of a placement using architecture-specific metrics. The shortcoming of using architecture-specific routability estimates is limited adaptability. A placement algorithm that is targeted to a class of architecturally similar FPGAs may not be easily adapted to other architectures. The subject of this paper is the development of a routability-driven architecture adaptive FPGA placement algorithm called Independence. The core of the Independence algorithm is a simultaneous placeand-route approach that tightly couples a simulated annealing placement algorithm with an architecture adaptive FPGA router (Pathfinder). The results of our experiments demonstrate Independence’s adaptability to island-style FPGAs, a hierarchical FPGA architecture (HSRA), and a coarse-grained reconfigurable architecture (RaPiD). The quality of the placements produced by Independence

• Type: Conference
• Year: 2005
• Where: FPL
• Authors: Akshay Sharma, Carl Ebeling, Scott Hauck
• Keywords: Architecture Adaptive Fpga, Fpga Placement Algorithm, FPL 2005, Placement Algorithm