| Timing-driven placement for FPGAs |
| Full text |
Pdf
(883 KB)
|
| Source
|
International Symposium on Field Programmable Gate Arrays
archive
Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays
table of contents
Monterey, California, United States
Pages: 203 - 213
Year of Publication: 2000
ISBN:1-58113-193-3
|
|
Authors
|
|
Alexander Marquardt
|
Right Track CAD Corp., 720 Spadina Ave., Suite #313, Toronto, ON and Dept. of Electrical and Computer Engineering, University of Toronto, 10 King's College Road, Toronto, ON, M5S 3G4
|
|
Vaughn Betz
|
Right Track CAD Corp., 720 Spadina Ave., Suite #313, Toronto, ON and Dept. of Electrical and Computer Engineering, University of Toronto, 10 King's College Road, Toronto, ON, M5S 3G4
|
|
Jonathan Rose
|
Right Track CAD Corp., 720 Spadina Ave., Suite #313, Toronto, ON and Dept. of Electrical and Computer Engineering, University of Toronto, 10 King's College Road, Toronto, ON, M5S 3G4
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 59, Citation Count: 53
|
|
|
ABSTRACT
In this paper we introduce a new Simulated Annealing-based timing-driven placement algorithm for FPGAs. This paper has three main contributions. First, our algorithm employs a novel method of determining source-sink connection delays during placement. Second, we introduce a new cost function that trades off between wire-use and critical path delay, resulting in significant reductions in critical path delay without significant increases in wire-use. Finally, we combine connection-based and path-based timing-analysis to obtain an algorithm that has the low time-complexity of connection-based timing-driven placement, while obtaining the quality of path-based timing-driven placement.A comparison of our new algorithm to a well known non-timing-driven placement algorithm demonstrates that our algorithm is able to increase the post-place-and-route speed (using a full path-based timing-driven router and a realistic routing architecture) of 20 MCNC benchmark circuits by an average of 42%, while only increasing the minimum wiring requirements by an average of 5%.
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
|
V. Betz, "Architecture and CAD for Speed and Area Optimization of FPGAs," Ph.D. Dissertation, University of Toronto, 1998.
|
| |
2
|
|
| |
3
|
R. Hitchcock, G. Smith and D. Cheng, "Timing Analysis of Computer-Hardware," IBM Journal of Research and Development, Jan. 1983, pp. 100- 105.
|
| |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
B. Riess and Cx Ettelt, "SPEED: Fast and Efficient Timing Driven Placement," IEEE International Symposium on Circuits and Systems, 1995, pp. 377 - 380.
|
| |
8
|
S. Yang, "Logic Synthesis and Optimization Benchmarks, Version 3.0," Tech. Report, Microelectronics Center of North Carolina, 1991.
|
| |
9
|
E.M. Sentovich et al, "SIS: A System for Sequential Circuit Analysis," Tech. Report No. UCB/ERL M92/41, University of California, Berkeley, 1992.
|
| |
10
|
J. Cong and Y. Ding, "Flowmap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup- Table Based FPGA Designs," IEEE Trans. on CAD, Jan. 1994, pp. 1-12.
|
| |
11
|
Xilinx Inc., "Virtex 2.5 V Field Programmable Gate Arrays", Advance Product Data Sheet, 1998.
|
| |
12
|
S. Kirkpatrick, C. Gelatt and M. Vecchi, "Optimization by Simulated Annealing," Science, May 13, 1983, pp. 671 - 680.
|
| |
13
|
|
 |
14
|
|
| |
15
|
A. Marquardt, "Cluster-Based Architecture, Timing-Driven Packing. and Timing-Driven Placement for FPGAs," M.A.Sc. Thesis, University of Toronto, 1999.
|
CITED BY 53
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Jason Cong , Yiping Fan , Xun Yang , Zhiru Zhang, Architecture and synthesis for multi-cycle communication, Proceedings of the 2003 international symposium on Physical design, April 06-09, 2003, Monterey, CA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Liang-Yu Lin , Cheng-Yeh Wang , Pao-Jui Huang , Chih-Chieh Chou , Jing-Yang Jou, Communication-driven task binding for multiprocessor with latency insensitive network-on-chip, Proceedings of the 2005 conference on Asia South Pacific design automation, January 18-21, 2005, Shanghai, China
|
|
|
|
|
|
Miloš Hrkić , Miloš Hrkić , John Lillis , Giancarlo Beraudo, An approach to placement-coupled logic replication, Proceedings of the 41st annual conference on Design automation, June 07-11, 2004, San Diego, CA, USA
|
|
|
|
|
|
|
|
|
|
|
|
Hosung (Leo) Kim , John Lillis , Miloš Hrkić , Miloš Hrkić, Techniques for improved placement-coupled logic replication, Proceedings of the 16th ACM Great Lakes symposium on VLSI, April 30-May 01, 2006, Philadelphia, PA, USA
|
|
|
|
|
|
Yue Zhuo , Hao Li , Qiang Zhou , Yici Cai , Xianlong Hong, New timing and routability driven placement algorithms for FPGA synthesis, Proceedings of the 17th great lakes symposium on Great lakes symposium on VLSI, March 11-13, 2007, Stresa-Lago Maggiore, Italy
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Di Wu , G. Venkataraman , Jiang Hu , Quiyang Li , R. Mahapatra, DiCER: distributed and cost-effective redundancy for variation tolerance, Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, p.393-397, November 06-10, 2005, San Jose, CA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|