Architecture Adaptive Routability-Driven Placement for FPGAs (abstract only)

Authors:
Akshay Sharma;Carl Ebeling;Scott Hauck
Affiliations:
University of Washington, Seattle, WA;University of Washington, Seattle, WA;University of Washington, Seattle, WA
Venue:
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays
Year:
2005

Citing 0
Cited 8

Architecture-adaptive range limit windowing for simulated annealing FPGA placement

Proceedings of the 42nd annual Design Automation Conference
Un/DoPack: re-clustering of large system-on-chip designs with interconnect variation for low-cost FPGAs

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Automatic Design of Area-Efficient Configurable ASIC Cores

IEEE Transactions on Computers
Prefabrication and postfabrication architecture exploration for partially reconfigurable VLIW processors

ACM Transactions on Embedded Computing Systems (TECS)
High-level modelling and exploration of coarse-grained re-configurable architectures

Proceedings of the conference on Design, automation and test in Europe
Automatic design of reconfigurable domain-specific flexible cores

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A design flow for architecture exploration and implementation of partially reconfigurable processors

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
High-level modeling and synthesis for embedded FPGAs

Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 place-and-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 and hierarchical FPGA architectures. The quality of the placements produced by Independence is within 5% of the quality of VPR's placements and 17% better than the placements produced by HSRA's place-and-route tool. Further, our results show that Independence produces clearly superior placements on routing-poor island-style FPGA architectures.