On metrics for comparing interconnect estimation methods for FPGAs
Authors:
- 19 April 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 12 (4) , 381-385
Abstract
Interconnect management is a critical design issue for large field-programmable gate arrays (FPGA) based designs. One of the most important issues for planning interconnection is the ability to reliably and efficiently predict the interconnect requirements of a given design on a given FPGA architecture. Many interconnect estimation methods have been reported so far and the estimation problem is also under active research. From a CAD tool deployment point of view, comparing these estimation methods is very difficult because of the different reporting methods used by the authors. We make an argument for and propose a new uniform reporting metric, based on comparing the estimates with the results of an actual detailed router on both local and global levels. We then compare some of the well known and promising interconnect estimation methods using our new metric on a large number of benchmark circuits.Keywords
This publication has 14 references indexed in Scilit:
- Sequencing-by-hybridization revisited: the analog-spectrum proposalIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- On metrics for comparing routability estimation methods for FPGAs2002
- fGREP - Fast Generic Routing Demand Estimation for Placed FPGA Circuits2001
- Estimating routing congestion using probabilistic analysis2001
- Interconnect complexity-aware FPGA placement using Rent's rule2001
- A fast routability-driven router for FPGAs1998
- VPR: a new packing, placement and routing tool for FPGA research1997
- PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs1995
- A stochastic model to predict the routability of field-programmable gate arraysIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Placement and average interconnection lengths of computer logicIEEE Transactions on Circuits and Systems, 1979