ACM Home Page
Please provide us with feedback. Feedback
Path-delay constrained floorplanning: a mathematical programming approach for initial placement
Full text PdfPdf (678 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 26th ACM/IEEE Design Automation Conference table of contents
Las Vegas, Nevada, United States
Pages: 364 - 369  
Year of Publication: 1989
ISBN:0-89791-310-8
Authors
S. Prasitjutrakul  Department of Computer Science, University of Illinois at Urbana-Champaign, 1304 W. Springfield Avenue, Urbana, Illinois
W. J. Kubitz  Department of Computer Science, University of Illinois at Urbana-Champaign, 1304 W. Springfield Avenue, Urbana, Illinois
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS\TCDA : TC Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 9,   Citation Count: 3
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/74382.74443
What is a DOI?

ABSTRACT

A procedure for path-delay constrained initial placement during chip floorplanning is presented which directly incorporates timing and geometrical constraints into the process. The problem is modeled and mathematically formulated as a constrained non-linear programming problem which is systematically divided and solved in three steps: timing minimization with module overlap, module separation and timing minimization without module overlap. To save computation time, two techniques for eliminating non-logical and noncritical paths are used to reduce the number of paths considered during the optimization. Experimental results show that the placement results satisfy all given timing and geometrical constraints, and have good total normalized wire delays.


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.

 
AlAs88
Alon, A. and Ascher, U., "Model and Solution Strategy for Placement of Rectangular Blocks in the Euclidean Plane," IEEE Trans. on Computer-Aided Design, Vol.7 No.3 (1988), pp. 378-380.
 
BeKi86
Berkcan, E~ and Kinnen, E., "Dim-REL: Performance Biased Placement Program for Custom IC Layout," Proc. Custom Integrated Circuit Conf. (lgs ), pp 2 3-2 8.
BuYo85
 
DADJ84
 
DCDJ87
Dai, W., Chen, H., Dutta, R., Jackson, M. and et.al., "Bear: A New Building-Block Layout System," Proc. International Conf. on Computer- Aided Design (1987), pp. 34-37.
 
FiMc68
Fiacco, A. and McCormick, G., Nonlinear Programming." Sequential Unconstrained Minimization Techniques, New York: Wiley, 1968.
 
HaNY87
Hauge, P., N~ir, R. and Yoffa, E., "Circuit Placement for Predictable Performance," Proc. International Conj. on Computer-Aided Design (i sV, pp. ss-oi.
 
HsKu87
Hsh, Y-C. and Kubitz, W., "A Procedure for Chip Floorplanning," Proc. International Syrup. on Circuits and Systems (1987}, pp. 568-571.
 
JaKM87
JackSon, M., Kuh, E.S. and Marek-Sadowska, M., "Timing Driven Routing for Building Block Layout, pq Proc. International Syrup. on Circuits and Systems (i987), pp. 518-519.
 
OIST86
 
PeSU88
 
RWKN88
Rose, M., Wiesel, M., Kirkpatrick, D. and Nettleton, N., "Dense, Performance Directed, Auto Place and Route." Proc. Custom Integrated Circuit Conf. (I988), pp 11.1.1 - 11.1.4.
 
ShYB88
Shragowitz, E., Youssef, H. and Benning, L., "Predictive Tools in VLSI System Design : Timing Aspects," COMPEURO (1988), pp. 48-55.
 
WeEs85


Collaborative Colleagues:
S. Prasitjutrakul: colleagues
W. J. Kubitz: colleagues