| Exploring adjacency in floorplanning |
| Full text |
Pdf
(199 KB)
|
Source
|
Asia and South Pacific Design Automation Conference
archive
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
table of contents
Yokohama, Japan
SESSION: Beyond traditional floorplanning and placement
table of contents
Pages: 367-372
Year of Publication: 2009
ISBN:978-1-4244-2748-2
|
|
Authors
|
|
Jia Wang
|
Illinois Institute of Technology, Chicago, IL
|
|
Hai Zhou
|
Fudan University, China and Northwestern University
|
|
| Sponsors |
|
| Publisher |
IEEE Press
Piscataway, NJ, USA
|
| Bibliometrics |
Downloads (6 Weeks): 8, Downloads (12 Months): 38, Citation Count: 0
|
|
|
ABSTRACT
This paper describes a new floorplanning approach called Constrained Adjacency Graph (CAG) that helps exploring adjacency in floorplans. CAG extends the previous adjacency graph approaches by adding explicit adjacency constraints to the graph edges. After sufficient and necessary conditions of CAG are developed based on dissected floorplans, CAG is extended to handle general floorplans in order to improve area without changing the adjacency relations dramatically. These characteristics are currently utilized in a randomized greedy improvement heuristic for wire length optimization. The results show that better floorplans are found with much less running time for problems with 100 to 300 modules in comparison to a simulated annealing floorplanner based on sequence pairs.
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
|
J. Garson. A Dual Linear Graph Representation for Space-Filling Location Problems of the Floor-planning Type. G. T. Moore (ed.) Emerging Methods in Environmental Design and Planning, MIT Press, 1970.
|
| |
3
|
|
| |
4
|
J. Bhasker and S. Sahni. A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph. Algorithmica, 3:247--278, 1988.
|
| |
5
|
Y. T. Lai and S. M. Leinwand. Algorithms for Floorplan Design via Rectangular Dualization. IEEE Trans. on Computer-Aided Design, 7(12):1278--1289, December 1988.
|
 |
6
|
|
| |
7
|
Xianlong Hong , Gang Huang , Yici Cai , Jiangchun Gu , Sheqin Dong , Chung Kuan Cheng , Jun Gu, Corner block list: an effective and efficient topological representation of non-slicing floorplan, Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design, November 05-09, 2000, San Jose, California
|
| |
8
|
F. Y. Young, C. C. Chu, and Z. C. Shen. Twin Binary Sequences: A Non-redundant Representation for General Non-Slicing Floorplan. IEEE Trans. on Computer-Aided Design, 22(4):457--469, April 2003.
|
| |
9
|
|
| |
10
|
|
| |
11
|
S. N. Adya and I. L. Markov. Fixed-outline Floorplanning: Enabling Hierarchical Design. IEEE Trans. On VLSI Systems, 11(6):1120--1135, December 2003.
|
| |
12
|
|
 |
13
|
Pei-Ning Guo , Chung-Kuan Cheng , Takeshi Yoshimura, An O-tree representation of non-slicing floorplan and its applications, Proceedings of the 36th ACM/IEEE conference on Design automation, p.268-273, June 21-25, 1999, New Orleans, Louisiana, United States
[doi> 10.1145/309847.309928]
|
 |
14
|
|
 |
15
|
|
 |
16
|
|
|