Placement and routing for performance-oriented FPGA layout

被引:5
作者
Alexander, MJ [1 ]
Cohoon, JP
Ganley, JL
Robins, G
机构
[1] Washington State Univ, Sch Elect Engn & Comp Sci, Pullman, WA 99164 USA
[2] Univ Virginia, Dept Comp Sci, Charlottesville, VA 22903 USA
[3] Cadence Design Syst Inc, San Jose, CA 95134 USA
关键词
FPGAs; placement; routing; performance-driven layout; Steiner trees; arborescences; multi-weighted graphs;
D O I
10.1155/1998/38483
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a performance-oriented placement and routing tool for field-programmable gate arrays. Using recursive geometric partitioning for simultaneous placement and global routing, and a graph-based strategy for detailed routing, our tool optimizes source-sink pathlengths, channel width and total wirelength. Our results compare favorably with other FPGA layout tools, as measured by the maximum channel width required to place and route several benchmarks.
引用
收藏
页码:97 / 110
页数:14
相关论文
共 43 条
[1]   New performance-driven FPGA routing algorithms [J].
Alexander, MJ ;
Robins, G .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1996, 15 (12) :1505-1517
[2]  
ALEXANDER MJ, 1994, EURO-DAC '94 WITH EURO-VHDL 94, PROCEEDINGS, P259
[3]  
ALEXANDER MJ, 1994, P ACM SIGDA INT WORK
[4]  
ALEXANDER MJ, 1995, P EUR DES AUT C BRIG
[5]  
BAPAT S, 1993, P IEEE INT C VLSI DE, P236
[6]  
BHAT N, 1992, P IEEE INT C COMP DE, P95, DOI [10.1109/ICCD.1992.276199, DOI 10.1109/ICCD.1992.276199]
[7]   A DETAILED ROUTER FOR FIELD-PROGRAMMABLE GATE ARRAYS [J].
BROWN, S ;
ROSE, J ;
VRANESIC, ZG .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1992, 11 (05) :620-628
[8]  
Brown S. D., 1992, FIELD PROGRAMMABLE G
[9]  
CARTER WS, 1986, CUSTOM INTEGRATED CI, P233
[10]  
CHAN PK, 1993, P ACM IEEE DES AUT C, P326