ACM Home Page
Please provide us with feedback. Feedback
Efficient circuit clustering for area and power reduction in FPGAs
Full text PdfPdf (936 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays table of contents
Monterey, California, USA
Session: Physical Design table of contents
Pages: 59 - 66  
Year of Publication: 2002
ISBN:1-58113-452-5
Authors
Amit Singh  University of California, Santa Barbara, Santa Barbara, CA
Malgorzata Marek-Sadowska  University of California, Santa Barbara, Santa Barbara, CA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 62,   Citation Count: 25
Additional Information:

abstract   references   cited by   collaborative colleagues  

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

ABSTRACT

We present a routability-driven bottom-up clustering technique for area and power reduction in clustered FPGAs. This technique uses a cell connectivity metric to identify seeds for efficient clustering. Effective seed selection, coupled with an interconnect-resource aware clustering and placement, can have a favorable impact on circuit routability. It leads to better device utilization, savings in area, and reduction in power consumption. Routing area reduction of 35% is achieved over previously published results. Power dissipation simulations using a buffered pass-transistor-based FPGA interconnect model are presented. They show that our clustering technique can reduce the overall device power dissipation by an average of 13%.


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
V. Betz, J. Rose, "Cluster-Based Logic Blocks for FPGAs:Area-Efficiency vs. Input sharing and Size", IEEE Custom Integrated Circuits Conference, 1997,pp.551-554.
 
4
 
5
J. Cong, L. W. Hagen, and A.B. Kahng, "Random Walks for Circuit Clustering", Proc IEEE Conf. on ASIC pp. 14.2.1 -14.2.4, June 1991.
 
6
J. Cong, and Y. Ding, "FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs". IEEE Trans. on Computer-Aided Design, Jan. 1994, Vol. 13, No. 1, pp. 1-12.
7
8
9
 
10
W.E. Donath, "Placement and Average Interconnect requirements of Computer logic", IEEE Trans. Circuits and Systems, CAS-26:272-277, 1979.
 
11
J. Garbers, H.J. Promel, and A. Steger, "Finding Clusters in VLSI Circuits", ICCAD 1990, pp. 520-523.
 
12
L. W. Hagen and A. B. Kahng, "Combining Problem Reduction and Adaptive Multi-Start: A New Technique for Superior Iterative Partitioning", IEEE Transactions on Computer-Aided Design, 1997, pp. 709-717.
 
13
 
14
A. B. Kahng and R. Sharma, "Studies of Clustering Objectives and Heuristics for Improved Standard-Cell Placement", UCLA CS Dept report, January 1997.
 
15
S. Kirpatrick, C.D. Gelatt, M.P. Vecchi, "Optimization by Simulated Annealing", Science, 220:671-680, 1983.
 
16
B.S. Landman, R.L. Russo, "On a pin versus block relationship for partitions of logic graphs", IEEE Trans. on Computers, C-20:1469-1479, 974.
 
17
H. Van Marck, D. Stroobandt, J. Van Campenhout, "Towards an extension of Rent's rule for describing local variations in interconnect complexity" Proc. 4th Intl. Symposium for Young Computer Scientists, pp.136-141, 1995.
18
19
 
20
 
21
D. Stroobandt, P. Verplaeste, J. Van Campenhout, "Generating synthetic benchmark circuits for evaluating CAD tools", IEEE Trans. on CAD, 19(9):1011-1022, September 2000.
 
22
 
23

CITED BY  25
Collaborative Colleagues:
Amit Singh: colleagues
Malgorzata Marek-Sadowska: colleagues