| Slicing floorplan with clustering constraints |
| Full text |
Pdf
(360 KB)
|
| Source
|
Asia and South Pacific Design Automation Conference
archive
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
table of contents
Yokohama, Japan
Pages: 503 - 508
Year of Publication: 2001
ISBN:0-7803-6634-4
|
|
Authors
|
|
Wing Seung Yuen
|
Department of Computer Science and Engineering, The Chinese University of Hong Kong
|
|
Fung Yu Young
|
Department of Computer Science and Engineering, The Chinese University of Hong Kong
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 16, Citation Count: 0
|
|
|
ABSTRACT
In floorplan design it is useful to allow users to specify placement constraints in the final packing. Clustering constraint is one kind of placement constraint in which a given set of modules are restricted to be geometrically adjacent to one another. The wiring cost can be reduced by putting modules with a lot of connections closely together. Designers may also need this type of placement constraint to pack the modules according to their functionality. In this paper, a method addressing clustering constraint in slicing floorplan is presented. A linear time algorithm is deviced to locate neighboring modules in a normalized Polish expression and re-arrange the modules in order to satisfy the constraints. Experiments were performed on some benchmarks and the results are promising.
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
|
[3] H. Murata, K. Fujiyoshi, and M. Kaneko, "VLSI/PCB placement with obstacles based on sequence-pair," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 17, pp. 60-68, Jan. 1998.
|
| |
4
|
Shigetoshi Nakatake , Kunihiro Fujiyoshi , Hiroshi Murata , Yoji Kajitani, Module placement on BSG-structure and IC layout applications, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, p.484-491, November 10-14, 1996, San Jose, California, United States
|
 |
5
|
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]
|
 |
6
|
Yun-Chih Chang , Yao-Wen Chang , Guang-Ming Wu , Shu-Wei Wu, B*-Trees: a new representation for non-slicing floorplans, Proceedings of the 37th conference on Design automation, p.458-463, June 05-09, 2000, Los Angeles, California, United States
[doi> 10.1145/337292.337541]
|
| |
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
|
|
| |
9
|
|
| |
10
|
Takayuki Yamanouchi , Kazuo Tamakashi , Takashi Kambe, Hybrid floorplanning based on partial clustering and module restructuring, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, p.478-483, November 10-14, 1996, San Jose, California, United States
|
 |
11
|
|
| |
12
|
[12] F.Y. Young and D. F. Wong, "Slicing floorplans with boundary constraints," in Proceeding of IEEE Asia South Pacific Design Automation Conference, pp. 17-20, 1999.
|
|