DocumentCode
2995195
Title
RPack: routability-driven packing for cluster-based FPGAs
Author
Bozorgzadeh, E. ; Ogrenci-Memik, S. ; Sarrafzadeh, M.
Author_Institution
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
fYear
2001
fDate
2001
Firstpage
629
Lastpage
634
Abstract
Routing tools consume a significant portion of the total design time. Considering routability at earlier steps of the CAD flow would both yield better quality and faster design process. We present a routability-driven clustering method for cluster-based FPGAs. Our method packs LUTs into logic clusters while incorporating routability metrics into a cost function. The objective is to minimize this routability cost function. Our cost function is consistently able to indicate improved routability. Our method yields up to 50% improvement over existing clustering methods in terms of the number of routing tracks required. The average improvement obtained is 16.5%. Reduction in number of tracks yields reduced routing area
Keywords
circuit complexity; circuit layout CAD; field programmable gate arrays; logic CAD; logic partitioning; network routing; table lookup; CAD flow; LUT packing; RPack; cluster-based FPGA; clustering method; cost function; island-type structure; logic clusters; number of routing tracks; routability metrics; routability-driven packing; Clustering methods; Computer science; Cost function; Design automation; Field programmable gate arrays; Integrated circuit interconnections; Logic arrays; Logic circuits; Routing; Table lookup;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 2001. Proceedings of the ASP-DAC 2001. Asia and South Pacific
Conference_Location
Yokohama
Print_ISBN
0-7803-6633-6
Type
conf
DOI
10.1109/ASPDAC.2001.913379
Filename
913379
Link To Document