| On the sensitivity of FPGA architectural conclusions to experimental assumptions, tools, and techniques |
| Full text |
Pdf
(292 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: Architecture Analysis and Automation
table of contents
Pages: 147 - 156
Year of Publication: 2002
ISBN:1-58113-452-5
|
|
Authors
|
|
Andy Yan
|
University of British Columbia, Vancouver, B.C., Canada
|
|
Rebecca Cheng
|
University of British Columbia, Vancouver, B.C., Canada
|
|
Steven J. E. Wilton
|
University of British Columbia, Vancouver, B.C., Canada
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 12, Citation Count: 7
|
|
|
ABSTRACT
Recent years have seen a tremendous increase in the capacities and capabilities of Field-Programmable Gate Arrays (FPGA's). Much of this dramatic improvement has been the result of changes to the FPGAs' internal architectures. New architectural proposals are routinely generated in both academia and industry. For FPGA's to continue to grow, it is important that these new architectural ideas are fairly and accurately evaluated, so that those worthy ideas can be included in future chips. Typically, this evaluation is done using experimentation. However, the use of experimentation is dangerous, since it requires making assumptions regarding the tools and architecture of the device in question. If these assumptions are not accurate, the conclusions from the experiments may not be meaningful. In this paper, we investigate the sensitivity of FPGA architectural conclusions to experimental variations. To make our study concrete, we evaluate the sensitivity of four previously published and well-known FPGA architectural results: lookup-table size, switch block topology, cluster size, and memory size. It is shown that these experiments are significantly affected by the assumptions, tools, and techniques used in the experiments.
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
|
J. Cong and Y. Ding, Flowmap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs, IEEE Transactions on Computer- Aided Design of Integrated Circuits and Systems, vol. 13, pp. 1-12, Jan, 1994.
|
 |
4
|
|
| |
5
|
J. Rose, R.J. Francis, D. Lewis, and P. Chow, Architecture of Field-Programmable Gate Arrays: The Effect of Logic Block Functionality on Area Efficiency IEEE Journal of Solid-State Circuits, vol. 25, pp. 1217-1225, Oct, 1990.
|
| |
6
|
J. Rose, R.J. Francis, P. Chow, and D. Lewis, "The Effect of Logic Block Complexity on Area of Programmable Gate Arrays," IEEE Custom Integrated Circuits Conference, May, 1989, pp. 5.3.1-5.3.5.
|
| |
7
|
|
| |
8
|
S.J.E. Wilton, Heterogeneous Technology Mapping for Area Reduction in FPGAs with Embedded Memory Arrays IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 19, pp. 56-68, Jan, 2000.
|
| |
9
|
|
| |
10
|
S.J.E. Wilton, "Implementing Logic in FPGA Embedded Memory Arrays: Architectural Implications," IEEE Custom Integrated Circuits Conference, May 1998.
|
| |
11
|
|
| |
12
|
Xilinx, Inc. XC4000E and XC4000X Field-Programmable Gate Arrays Datasheet, v. 1.6. 1999.
|
 |
13
|
|
 |
14
|
|
 |
15
|
|
| |
16
|
R.J Francis, J. Rose, Z. Vranesic, "Technology Mapping Lookup Table-Based FPGAs for Performance" Proc. 1991 IEEE International Conference on Computer-Aided Design (ICCAD), November 1991, pp. 568-571.
|
|