| Multi-way FPGA partitioning by fully exploiting design hierarchy |
| Full text |
Pdf
(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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 8, Citation Count: 3
|
|
|
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
|
G. Saucier , D. Brasen , J. P. Hiol, Partitioning with cone structures, Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, p.236-239, November 07-11, 1993, Santa Clara, California, United States
|
 |
6
|
Roman Kužnar , Franc Brglez , Krzysztof Kozminski, Cost minimization of partitions into multiple devices, Proceedings of the 30th international conference on Design automation, p.315-320, June 14-18, 1993, Dallas, Texas, United States
[doi> 10.1145/157485.164910]
|
 |
7
|
Nan-Chi Chou , Lung-Tien Liu , Chung-Kuan Cheng , Wei-Jin Dai , Rodney Lindelof, Circuit partitioning for huge logic emulation systems, Proceedings of the 31st annual conference on Design automation, p.244-249, June 06-10, 1994, San Diego, California, United States
[doi> 10.1145/196244.196365]
|
| |
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
|
|
CITED BY 3
|
|
Joachim Pistorius , Edmée Legai , Michel Minoux, Generation of very large circuits to benchmark the partitioning of FPGA, Proceedings of the 1999 international symposium on Physical design, p.67-73, April 12-14, 1999, Monterey, California, United States
|
|
|
|
|
|
|
|