ACM Home Page
Please provide us with feedback. Feedback
Timing closure based on physical hierarchy
Full text PdfPdf (315 KB)
Source International Symposium on Physical Design archive
Proceedings of the 2002 international symposium on Physical design table of contents
San Diego, CA, USA
SESSION: Timing Closure table of contents
Pages: 170 - 174  
Year of Publication: 2002
ISBN:1-58113-460-6
Author
Jason Cong  Univ. of California, Los Angeles, Los Angeles, CA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 17,   Citation Count: 6
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/505388.505429
What is a DOI?

ABSTRACT

In this paper, we shall present the progress and results of the ongoing project at UCLA on synthesis and optimization under physical hierarchy. First, we shall motivate our approach by pointing out the limitations of the existing approach to interconnect planning based on early RTL floorplanning following logic hierarchy. Then, we shall discuss the technical challenges for synthesis under the physical hierarchy, including handling high computational complexity from the flattened logic hierarchy, needs of retiming and pipelining over global interconnects, and extension of existing synthesis operations. Finally, we shall outline our approaches to overcome these technical challenges.


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
Semiconductor Industry Association, International Technology Roadmap for Semiconductors, 1999.
 
2
Semiconductor Industry Association, International Technology Roadmap for Semiconductors, 1997.
 
3
Cong, J., He, L., Koh, C.-K., Pan, D. Z., and Yuan, X. Tree-Repeater-Interconnect-Optimization Package (TRIO), 1999, http://cadlab.cs.ucla.edu/~trio.
 
4
Cong, J. An Interconnect-centric Design Flow for Nanometer Technologies, in Proceedings of the IEEE, vol. 89, 505--527, April 2001.
 
5
Brandt, A., Multi-level Adaptive Solution to Boundary Value Problems, Mathematics of Computation, vol.31, no.138, 333--390, 1977.
 
6
Briggs, W., A Multigrid Tutorial, SIAM, 1987.
 
7
8
 
9
 
10
Kleinhans, J., Sigl, G., Johannes, F., and Antreich, K. GORDIAN: VLSI Placement by Quadratic Programming and Slicing Optimization, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.10, March 1991.
11
 
12
Pan, P., Karandikar, A. K., and Liu, C.-L. Optimal Clock Period Clustering for Sequential Circuits with Retiming, IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 489--498, 1998.
 
13
 
14
Cong, J., and Ding, Y. On Area/Depth Trade-off in LUT-Based FPGA Technology Mapping, IEEE Trans. on VLSI Systems, vol. 2, no. 2, 137--148, June 1994.
 
15