Title :
An efficient router for 2-D field programmable gate array
Author :
Wu, Yu-Liang ; Sadowska, Malgorzata Marek-
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
fDate :
28 Feb-3 Mar 1994
Abstract :
In this paper, we analyze the traditional 2-step global/detailed routing scheme. We propose a bin-packing heuristic based greedy 2-D router that can effectively and stably produce good results in both minimizing routing length and number of tracks needed to complete routing. On the tested MCNC benchmarks, our router resulted 17% less total tracks compared to the best known results of 2-step routers. Our one-step router is linear in both CPU time and run-time memory which suggests its particular suitability for very large circuits
Keywords :
VLSI; circuit layout CAD; logic CAD; logic arrays; network routing; 2D FPGA; bin-packing heuristic; field programmable gate array; greedy 2-D router; one-step router; routing length; Benchmark testing; Central Processing Unit; Circuit testing; Field programmable gate arrays; Random access memory; Routing; Runtime; Switches; Table lookup; Wire;
Conference_Titel :
European Design and Test Conference, 1994. EDAC, The European Conference on Design Automation. ETC European Test Conference. EUROASIC, The European Event in ASIC Design, Proceedings.
Conference_Location :
Paris
Print_ISBN :
0-8186-5410-4
DOI :
10.1109/EDTC.1994.326843
