ACM Home Page
Please provide us with feedback. Feedback
Multiway FPGA partitioning by fully exploiting design hierarchy
Full text PdfPdf (130 KB)
Source ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 5 ,  Issue 1  (January 2000) table of contents
Pages: 34 - 50  
Year of Publication: 2000
ISSN:1084-4309
Authors
Wen-Jong Fang  Tsing Hua Univ., Taiwan
Allen C.-H. Wu  Tsing Hua Univ., Taiwan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 34,   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/329458.329463
What is a DOI?

ABSTRACT

In this paper, we present a new integrated synthesis and partitioning method for multiple-FPGA applications. Our approach bridges the gap between HDL synthesis and physical partitioning by fully exploiting the design hierarchy. We propose a novel multiple-FPGA synthesis and partitioning method which is performed in three phases: (1) fine-grained synthesis, (2) functional-based clustering, and (3) hierarchical set-covering partitioning. This method first synthesizes a design specification in a fine-grained way so that functional clusters can be preserved based on the structural nature of the design specification. Then, it applies a hierarchical set-covering partitioning method to form the final FPGA partitions. Experimental results on a number of benchmarks and industrial designs demonstrate that I&slash;O limits are the bottleneck for CLB utilization when applying a traditional multiple-FPGA synthesis method on flattened netlists. In contrast, by fully exploiting the design structural hierarchy during the multiple-FPGA partitioning, our proposed method produces fewer FPGA partitions with higher CLB and lower I&slash;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
3
4
 
5
COX,C.E.AND BLANZ, W. E. 1992. GANGLION- A fast field-programmable gate array implementation of a connectionist classifier. IEEE J. Solid-State Circuits 27 (Mar.), 288-299.
6
 
7
 
8
 
9
10
 
11
 
12
JONG, C. Y. 1996. Multi-way circuit partitioning for cost and delay minimizations. Master's Thesis. Tsinghua Univ. Press, Beijing, China.
 
13
KRING,C.AND NEWTON, A. R. 1991. A cell-replicating approach to mincut-based circuit partitioning. In Proceedings of the IEEE International Conference on Computer-Aided Design (Santa Clara, CA, Nov.) IEEE Computer Society Press, Los Alamitos, CA, 2-5.
14
15
 
16
MURGAI, R., SHENOY, N., BRAYTON,R.K.,AND SANGIOVANNI-VINCENTELLI, A. 1991. Improved logic synthesis algorithms for table look up architectures. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD '91, Santa Clara, CA, Nov. 11-14) IEEE Computer Society Press, Los Alamitos, CA, 564-567.
17
 
18
19
 
20
SCHMIT, H., ARNSTEIN, L., THOMAS, D., AND LAGNESE, E. 1994. Behavioral synthesis for FPGA-based computing. In Proceedings of the IEEE Workshop on Custom Computing Machines (Napa Valley, CA, Apr.) IEEE Computer Society Press, Los Alamitos, CA, 125-131.
 
21
VAN DEN BOUT, D. E. 1993. The anyboard: Programming and enhancements. In Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines (Napa Valley, CA, Apr.) IEEE Computer Society Press, Los Alamitos, CA, 68-77.
 
22
WALTERS, S. 1991. Computer-aided prototyping for ASIC-based systems. In Proceedings of the IEEE International Conference on Design and Test of Computers (June) IEEE Computer Society Press, Los Alamitos, CA, 4-10.
23


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