ACM Home Page
Please provide us with feedback. Feedback
Timing influenced layout design
Full text PdfPdf (674 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 22nd ACM/IEEE conference on Design automation table of contents
Las Vegas, Nevada, United States
Pages: 124 - 130  
Year of Publication: 1985
ISBN:0-8186-0635-5
Authors
Michael Burstein  Tangent Systems, 2840 San Tomas Expressway, Santa Clara, CA and IBM T. J. Watson Research Center, Yorktown Heights, New York
Mary N. Youssef  IBM Corporation, East Fishkill, Hopewell Junction, New York
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Citation Count: 37
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/317825.317845
What is a DOI?

ABSTRACT

We present a new approach to the automatic layout design for VLSI chips which incorporates timing information to influence the placement and wiring processes. This approach is an extension of the hierarchical layout method, in which placement and wiring are performed simultaneously [1]. We add a third phase of timing to the hierarchy, without affecting the computational complexity of the basic algorithm. Prior to the physical design, timing analysis is performed using statistical estimates for the unknown parameters; namely the lengths of interconnecting wires. The output of this analysis includes a measure for each net that indicates the degree of its contribution to the timing problem. This set of measures is used to bias the placement at the highest level of the hierarchy. Since wiring is performed after each level of partitioning, lengths of interconnecting nets among the partitions become available. These data are used to update the timing information that bias the design. Preliminary results show that, while delays due to interconnections are reduced, wireability of the chip does not deteriorate.


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
Burstein M., S. J. Hong and R. Pelavin, "Hierarchical VLSI Layout: Simultaneous Placement and Wiring of Gate Arrays," Proc. IFIP VLSI-83, Trondheim, August 1983.
 
2
Wolf P. K., Sr. et al, "Power/Tilning: Optimization and Layout Techniques for LSI Chips," Design Automation and Fault Tolerant Computing, 1978.
 
3
 
4
Hitchcock, R. Sr., G. Smith, D. Cheng, "Timing Analysis of Computer Hardware," IBM Journal of Research and Development, Vol. 26, NO. 1, 1982.
 
5
Kernighan, B. W. and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell System Technical Journal, Vol. 49, 1982.
 
6
 
7
Burstein M. and Pelavin, R., "Hier~trchical Wire Routing," IEEE Trans. on Computer-Aided Design 9f Integrated Data and Systems," Vol. CAD-2, No.4, 1983.
 
8
Burstein M. and Pelavila, R., "Hierarchical Wire of Gate-Array VLSI Chips", Proe. ECCTD'83 (6-th European Conf. Circuit Theory and Design), Stuttgart, Germany, 1983.

CITED BY  37
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Michael Burstein: colleagues
Mary N. Youssef: colleagues

Peer to Peer - Readers of this Article have also read: