ACM Home Page
Please provide us with feedback. Feedback
Rectangle-packing-based module placement
Full text Publisher SitePublisher Site PdfPdf (261 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California, United States
Pages: 472 - 479  
Year of Publication: 1995
ISBN:0-8186-7213-7
Authors
Hiroshi Murata  School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa 923-12, Japan
Kunihiro Fujiyoshi  School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa 923-12, Japan
Shigetoshi Nakatake  School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa 923-12, Japan
Yoji Kajitani  Department of Electrical and Electronic Engineering, Tokyo Institute of Technology, Meguro-ku, Tokyo 152, Japan
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 92,   Citation Count: 101
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

The first and the most critical stage in VLSI layout design is the placement, the background of which is the rectangle packing problem: Given many rectangular modules of arbitrary size, place them without overlapping on a layer in the smallest bounding rectangle. Since the variety of the packing is infinite (two- dimensionally continuous) many, the key issue for successful optimization is in the introduction of a P-admissible solution space, which is a finite set of solutions at least one of which is optimal. This paper proposes such a solution space where each packing is represented by a pair of module name sequences. Searching this space by simulated annealing, hundreds of modules could be successfully packed as demonstrated. Combining a conventional wiring method, the biggest MCNC benchmark ami49 is challenged.


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
B.S.Baker, E.G.Coffman, and R.L.Rivest, "Orthogonal Packings in Two Dimensions," SIAM J. Comput., vol. 9, no. 4, pp. 846-855, 1980.
2
 
3
A.Alon and U.Ascher, "Model and Solution Strategy for Placement of Rectangular Blocks in the Euclidean Plane," IEEE Trans. on CAD, vol. 7, no. 3, pp. 378- 386, 1988.
 
4
Y.G.Saab and V.B.Rao, "Combinatorial Optimization by Stochastic Evolution," IEEE Trans. on CAD, vol. CAD-10, no. 4, pp. 525-535, 1991.
 
5
 
6
 
7
W.M.Dai and E.Kuh, "Simaltaneous Floorplanning and Global Routing for Hierarchical Building Block Layout," IEEE Trans. on CAD, vol. CAD-6, no. 5, pp. 828-837, 1987.
8
9
 
10
 
11

CITED BY  101

Collaborative Colleagues:
Hiroshi Murata: colleagues
Kunihiro Fujiyoshi: colleagues
Shigetoshi Nakatake: colleagues
Yoji Kajitani: colleagues