Three-dimensional place and route for FPGAs
Authors:
- 8 May 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 25 (6) , 1132-1140
Abstract
We present timing-driven partitioning and simulated-annealing (SA)-based placement algorithms together with a detailed routing tool for three-dimensional (3-D) field-programmable gate array (FPGA) integration. The circuit is first divided into layers with a limited number of interlayer vias, and then placed on individual layers, while minimizing the delay of critical paths. We use our tool as a platform to explore the potential benefits, in terms of delay and wire length (WL), that 3-D technologies can offer for FPGA fabrics. Experimental results show, on average, a total decrease of 25% in WL and 35% in delay can be achieved over traditional two-dimensional chips, when ten layers are used in 3-D integrationKeywords
This publication has 33 references indexed in Scilit:
- Non-contiguous linear placement for reconfigurable fabrics2004
- Efficient thermal placement of standard cells in 3D ICs using a force directed approach2004
- GravityACM Transactions on Design Automation of Electronic Systems, 2003
- A survey of graph layout problemsACM Computing Surveys, 2002
- Universal switch blocks for three-dimensional FPGA design1999
- Using cluster-based logic blocks and timing-driven packing to improve FPGA speed and density1999
- Architecture and CAD for Deep-Submicron FPGAS1999
- VPR: a new packing, placement and routing tool for FPGA research1997
- Placement and routing tools for the Triptych FPGAIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1995
- Incremental techniques for the identification of statically sensitizable critical paths1991