ACM Home Page
Please provide us with feedback. Feedback
RPack: routability-driven packing for cluster-based FPGAs
Full text PdfPdf (273 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2001 Asia and South Pacific Design Automation Conference table of contents
Yokohama, Japan
Pages: 629 - 634  
Year of Publication: 2001
ISBN:0-7803-6634-4
Authors
Elaheh Bozorgzadeh  Computer Science Department, UCLA Los Angeles, CA
Seda Ogrenci-Memik  Department of ECE, Northw estern University, Ev anston, IL
Majid Sarrafzadeh  Computer Science Department, UCLA Los Angeles, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IPSJ : Information Processing Society of Japan
IEEE HK CAS : IEEE HK CAS and Comm. Joint Chapter
IEICE : Inst of Electronics, Info & Communication Engineers
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 13,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/370155.370567
What is a DOI?

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. In this paper we are presenting 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
 
4
 
5
N. Bhat, D. Hill, "Routable Technology Mapping for FPGAs," First International Workshop on FPGAs, pp. 143-148, Feb. 1992.
 
6
M. Schlag, J. Kong, P. K. Chan, "Routability-Driven Technology Mapping for Lookup Table-Based FPGAs," IEEE Transactions on CAD, Vol. 13, pp.13-26, Jan 1994.
7
 
8
J. Cong, Y. Ding, " FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Design," IEEE Trans. on Computer-Aided Design, Vol.13, No.1, pp. 1-12,Jan. 1994.
 
9
E. M. Sentovich, et al, "SIS: A System for Sequential Analysis," Tech. Report No. UCD/ERL M92/41 , University of California, Berkeley, 1992.
 
10
S. Yang, "Logic Synthesis and Optimization Benchmarks, Version 3.0," Tech. Report, Microelectronics Center of North Carolina, 1991.

CITED BY  9

Collaborative Colleagues:
Elaheh Bozorgzadeh: colleagues
Seda Ogrenci-Memik: colleagues
Majid Sarrafzadeh: colleagues