ACM Home Page
Please provide us with feedback. Feedback
Generic global placement and floorplanning
Full text PdfPdf (243 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 35th annual Design Automation Conference table of contents
San Francisco, California, United States
Pages: 269 - 274  
Year of Publication: 1998
ISBN:0-89791-964-5
Authors
Hans Eisenmann  Institute of Electronic Design Automation, Technical University Munich, 80290 Munich, Germany
Frank M. Johannes  Institute of Electronic Design Automation, Technical University Munich, 80290 Munich, Germany
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CS : Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 105,   Citation Count: 133
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/277044.277119
What is a DOI?

ABSTRACT

We present a new force directed method for global placement. Besides the well-known wire length dependent forces we use additional forces to reduce cell overlaps and to consider the placement area. Compared to existing approaches, the main advantage is that the algorithm provides increased flexibility and enables a variety of demanding applications. Our algorithm is capable of addressing the problems of global placement, floorplanning, timing minimization and interaction to logic synthesis. Among the considered objective functions are area, timing, congestion and heat distribution. The iterative nature of the algorithm assures that timing requirements are precisely met. While showing similar CPU time requirements it outperforms Gordian by an average of 6 percent and TimberWolf by an average of 8 percent in wire length and yields significantly better timing results.


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
N. Quinn and M. Breuer, "A force directed component placement procedure for printed circuit boards,'IEEETrans. CAS, vol. CAS-26, pp. 377-388, June 1979.
 
2
W.-J. Sun and C. Sechen, "Efficient and effective placement for very large circuits," IEEE Trans. CAD, vol. 14, no. 3, pp. 349-359, 1995.
 
3
A. Dunlop and B. Kernighan, "A procedure for placement of standard-cell VLSI circuits,"lEEE Trans. CAD, vol. CAD-4, pp. 92-98, Jan. 1985.
4
 
5
C.-K. Cheng and E. S.Kuh, "Module placement based on resistive network optimization," 1EEE Trans. CAD, vol. CAD-3, pp. 2 18-225, July 1984.
 
6
 
7
J.M. Kleinhans, G. Sigl, F. M. Johannes, and K. J. Antreich, "GORDIAN: VLS! placement by quadratic programming and slicing optimization," IEEE Trans. CAD, vol. CAD- 10, pp. 356-365, Mar. 1991.
 
8
9
 
10
R. Otten, "Efficient floorplan optimization," inlEEE ICCD, pp. 499-501, Oct. 1983.
 
11
K, M. Hall, "An r-dimensional quadratic placement algorithm,'' Management Science, vol. 17, pp. 219-229, Nov. 1970.
 
12
R. Ellis and D. Gulick, Calculus. Harcourt Brace Jovanovich, 1991.
 
13
W. E. Williams,Partial Differential Equations. Oxford University Press, 1980.
14
 
15
"www. cbl.ncsu.edu/benchmarks/layoutsynth92/"
 
16
"pefformance. netlib, org/performance/html/PDStop.htrnl"
 
17
K. Doll, F. M. Johannes, andK. J. Antreich, "Iterative placement improvement by network flow methods,?EEE Trans. CAD, vol. 13, pp. 1190-1200, Oct. 1994.
 
18
 
19
20
 
21
B.M. Riess and G. G. Ettelt, "Speed: Fast and efficient timing driven placement," in IEEE ISCAS, 1995.
 
22
A. Srinivasan, K. Chaudhary, and E. S. Kuh, "RITUAL: A performance driven placement algorithm,'TEEETrans. CAS, vol. CAS-39, pp. 825-840, Nov. 1992.

CITED BY  133

Collaborative Colleagues:
Hans Eisenmann: colleagues
Frank M. Johannes: colleagues