ACM Home Page
Please provide us with feedback. Feedback
TCG: a transitive closure graph-based representation for non-slicing floorplans
Full text PdfPdf (142 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 38th annual Design Automation Conference table of contents
Las Vegas, Nevada, United States
Pages: 764 - 769  
Year of Publication: 2001
ISBN:1-58113-297-2
Authors
Jai-Ming Lin  Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan
Yao-Wen Chang  Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 60,   Citation Count: 41
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/378239.379062
What is a DOI?

ABSTRACT

In this paper, we propose a transitive closure graph-based representation for general floorplans, called TCG, and show its superior properties. TCG combines the advantages of popular representations such as sequence pair, BSG, and B*-tree. Like sequence pair and BSG, but unlike O-tree, B*-tree, and CBL, TCG is P-admissible. Like B*-tree, but unlike sequence pair, BSG, O-tree, and CBL, TCG does not need to construct additional constraint graphs for the cost evaluation during packing, implying faster runtime. Further, TCG supports incremental update during operations and keeps the information of boundary modules as well as the shapes and the relative positions of modules in the representation. More importantly, the geometric relation among modules is transparent not only to the TCG representation but also to its operations, facilitating the convergence to a desired solution. All these properties make TCG an effective and flexible representation for handling the general floorplan/placement design problems with various constraints. Experimental results show the promise of TCG.


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
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, no. 4598, pp.671-680, May, 1983.
 
5
E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, 1976.
 
6
 
7
 
8
T. Ohtsuki, N. Suzigama, and H. Hawanishi, "An optimization technique for intergrated circuit layout design," Proc. ICCST, Kyoto, pp. 67-68, 1970.
9
 
10
 
11
P. Pan and C.-L. Liu, "Area minimization for floorplans," IEEE TCAD, pp. 123- 132, Jan. 1995.
12
 
13
14
15
 
16

CITED BY  42

Collaborative Colleagues:
Jai-Ming Lin: colleagues
Yao-Wen Chang: colleagues