ACM Home Page
Please provide us with feedback. Feedback
Placement rent exponent calculation methods, temporal behaviour and FPGA architecture evaluation
Full text PdfPdf (309 KB)
Source International Workshop on System-Level Interconnect Prediction archive
Proceedings of the 2003 international workshop on System-level interconnect prediction table of contents
Monterey, CA, USA
SESSION: Session 1: Noise and Timing Issues in Interconnect Prediction table of contents
Pages: 31 - 38  
Year of Publication: 2003
ISBN:1-58113-627-7
Authors
Joachim Pistorius  Altera Corp., San Jose, CA
Mike Hutton  Altera Corp., San Jose, CA
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 19,   Citation Count: 4
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/639929.639936
What is a DOI?

ABSTRACT

In the design of FPGA architectures, it is important to understand wiring requirements of placed circuits. Rent's Rule is an empirical metric of connectivity and congestion in a circuit that has applications in the prediction of interconnect usage.Traditional methods of calculating Rent exponents are based on recursive partitioning, with the exception of some recent work [21], [22] that defines an alternative Rent exponent of a circuit based on a placement-induced partitioning tree.In this paper we take a different look at the calculation of Rent exponents in placement, contrasting several different methods empirically and outlining the relevant biases in each. We will compare the Rent exponent observed for timing-driven vs. purely congestion-driven placement algorithms, and for different types of benchmark circuits. We also observe the temporal behaviour of Rent exponents through a simulated annealing placement and its correlation to the placement cost function and wirelength. Finally we apply the empirical results to the analysis of the Cyclone FPGA architecture and comment on the routability of the device.


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
Altera Corp. "Cyclone Family Data-Sheet". Available at www.altera.com.
 
2
V. Betz, "Directional Bias and Non-Uniformity in FPGA Global Routing Architectures", IEEE TVLSI, pp. 445--456, Sept. 1998.
 
3
4
 
5
T. Chiba, "Impact of the LSI on high-speed computer packaging," IEEE Trans. Comput., Vol C-27, pp. 319--325, 1978.
 
6
 
7
8
 
9
J. Davis, V. De and J. Meindl, "A stochastic wire-length distribution for gigascale integration (GSI): Part II: Application to clock frequency, power dissipation and chip-size estimation," IEEE Trans. Electron Devices, Vol. 45. pp 590--597. Mar, 1998.
10
 
11
W.E. Donath, "Placement and Average Interconnection Lengths of Computer Logic." IEEE Trans. Circuits and Systems, Vol 26(4), pp. 272--277, 1979.
 
12
M. Feuer, "Connectivity of Random Logic", IEEE Trans. On Computers, Vol C-31, pp. 29--33, 1982.
 
13
L. Hagen, A.B. Kahng, F.J. Kurdahi and C. Ramachandran, "On the Intrinsic Rent Parameter and Spectra-Based Partitioning Methodologies." IEEE Trans. CAD. Vol 13:1, pp. 27--37, 1994.
14
 
15
B Landman and R. Russo, "On a Pin vs. Block Relationship for Partitions of Logic Graphs." IEEE Trans. On Computers, Vol. C-20. pp 1469--1479, 1971.
16
 
17
D. Stroobandt, A Priori Wire Length Estimates for Digital Design, Kluwer, 2001.
18
 
19
 
20
P. Verplaetse, J. Van Campenhout and D. Stroobandt. "On Synthetic Benchmark Generation Methods." In Proc. Intl. Symp. On Circuits and Systems (ISCAS) pp. IV 213--216, May 2000.
21
22
 
23


Collaborative Colleagues:
Joachim Pistorius: colleagues
Mike Hutton: colleagues