ACM Home Page
Please provide us with feedback. Feedback
Buffering global interconnects in structured ASIC design
Full text PdfPdf (145 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2005 Asia and South Pacific Design Automation Conference table of contents
Shanghai, China
SESSION: Tree construction and buffering table of contents
Pages: 23 - 26  
Year of Publication: 2005
ISBN:0-7803-8737-6
Authors
Tianpei Zhang  University of Minnesota
Sachin S. Sapatnekar  University of Minnesota
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
: Shanghai IC Industry Association
: IEEE SSCS Shanghai Chapter
: IEEE CAS
: IEEE Beijing Section
: Fudan University
: Chinese Institute of Electronics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 17,   Citation Count: 2
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1120725.1120735
What is a DOI?

ABSTRACT

Structured ASICs present an attractive alternative to reducing design costs and turnaround times in nanometer designs. As with conventional ASICs, such designs require global wires to be buffered. However via-programmable designs must prefabricate and preplace buffers in the layout. This paper proposes a novel and accurate statistical estimation technique for distributing prefabricated buffers through a layout. It employs Rent's rule to estimate the buffer distribution required for the layout, so that an appropriate structured ASIC may be selected for the design. Experimental results show that the estimation for a uniform buffer distribution is accurate and economic.


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
4
5
6
 
7
8
9
 
10
C. W. Sham and E. F. Y. Young, "Routability Driven Floorplanner with Buffer Block Planning," IEEE Trans. on Comput.-Aided Design, 22(4), April 2003, pp. 470--480.
 
11
B. S. Landman and R. L. Russo, "On a Pin Versus Block Relationship for Partitions of Logic Graphs," IEEE Trans. on Comput., vol. C-20, December 1971, pp. 1469--1479.
 
12
J. A. Davis, V. K. De and J. D. Meindl, "A Stochastic Wire-Length Distribution for Gigascale Integration (GSI) - Part I: Derivation and Validation," IEEE Trans. Elec. Dev., 45(3), March 1998, pp. 580--589.
13
 
14
J. Cong, Y. Ding, "Flowmap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs," IEEE Trans. on Comput. Aided Design, 13(1), January 1994, pp. 1--12.
 
15
 
16
J. Cong, "Challenges and Opportunities for Design Innovations in Nanometer Technologies," Invited Semiconductor Research Corporation Design Sciences Concept Paper, January 1998.
 
17
Semiconductor Industry Association, International Technology Roadmap for Semiconductors, 2003.
 
18

Collaborative Colleagues:
Tianpei Zhang: colleagues
Sachin S. Sapatnekar: colleagues