ACM Home Page
Please provide us with feedback. Feedback
Multi-way FPGA partitioning by fully exploiting design hierarchy
Full text PdfPdf (223 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 34th annual Design Automation Conference table of contents
Anaheim, California, United States
Pages: 518 - 521  
Year of Publication: 1997
ISBN:0-89791-920-3
Authors
Wen-Jong Fang  Department of Computer Science, Tsing Hua University, Hsinchu, Taiwan, 300, Republic of China
Allen C.-H. Wu  Department of Computer Science, Tsing Hua University, Hsinchu, Taiwan, 300, Republic of China
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 8,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   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/266021.266270
What is a DOI?

ABSTRACT

In this paper, we present a new integrated synthesisand partitioning method for multiple-FPGA applications.This method first synthesizes a design specificationin a fine-grained way so that functional clusters can bepreserved based on the structural nature of the designspecification.Then, it applies a hierarchical set-coveringpartitioning method to form the final FPGA partitionings.Our approach bridges the gap between HDL synthesisand physical partitioning by fully exploiting the designhierarchy.Experimental results on a number of benchmarksand industrial designs demonstrate that I/O limitsare the bottleneck for CLB utilization when applying atraditional multiple-FPGA synthesis method on flattenednetlists.In contrast, by fully exploiting the design structuralhierarchy during the multiple-FPGA partitioning,our proposed method produces fewer FPGA partitionswith higher CLB and low I/O-pin utilizations.


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
C. E. Cox and W. E. Blan% "GANGLION- A Fast Field- Programmable Gate Array Implementation of a Connectionist Classifier," IEEE Journal on Solid-State Circuits, vol. 27, pp. 288-299, March 1992.
 
3
4
 
5
6
7
 
8
H. Schmit, L. Arnstein, D. Thomas, and E. Lagnese, "Behavioral Synthesis for FPGA-based Computing," Proceedings of IEEE Work.shop on FPGAs for Custom Computing Machines 199~,, pp. 125-131, 1994.
 
9
 
10
W.-J. Fang and Allen C.-H. Wu, "A Fine-Grained Synthesis Method for Logic Emulation Systems." Technical Reports, Computer Science Dept., Tsing Hua Univ., Taiwan, R.O.C., 1996.
 
11
R. Murgai, N. Shenoy, R. K. Brayton, and A. Sangiovanni- Vincentelli, "Improved Logic Synthesis Algorithms for Table Look Up Architectures," Proceedings of ICCAD91, pp. 564-567, 1991.
 
12


Collaborative Colleagues:
Wen-Jong Fang: colleagues
Allen C.-H. Wu: colleagues