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 infinitely many (two-dimensionally continuous), 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.
MicroArk Co., Ltd.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
L. Sha and R. W. Dutton, “An Analytical Algorithm for Placement of Arbitrarily Sized Rectangular Blocks,” in Proc. 22th ACM/IEEE Design Automation Conf., pp. 602–608, 1985.
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.
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.
R.H.J.M. Otten, “Automatic Floorplan Design,” in Proc. 19th ACM/IEEE Design Automation Conf., pp. 261–267, 1982.
D.F. Wong and C.L. Liu, “A New Algorithm for Floorplan Designs,” in Proc. 23rd ACM/IEEE Design Automation Conf., pp. 101–107, 1986.
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.
T.C. Wang and D.F. Wong, “An Optimal Algorithm for Floorplan Area Optimization,” in Proc. 27th ACM/IEEE Design Automation Conf., pp. 180–186, 1990.
H. Onodera, Y. Taniguchi, and K. Tamaru, “Branch-and-Bound Placement for Building Block Layout,” in Proc. 28th ACM/IEEE Design Automation Conf., pp. 433–439, 1991.
L. Stockmeyer, “Optimal Orientations of Cells in Slicing Floorplan Designs,” Information and Control, vol. 59, pp. 91–101, 1983.
P. Pan, W. Shi, and C. L. Liu, “Area Minimization for Hierarchical Floorplans,” in IEEE International Conf. on Computer Aided Design, pp. 436–440, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Murata, H., Fujiyoshi, K., Nakatake, S., Kajitani, Y. (2003). Rectangle-Packing-Based Module Placement. In: Kuehlmann, A. (eds) The Best of ICCAD. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0292-0_42
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0292-0_42
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5007-1
Online ISBN: 978-1-4615-0292-0
eBook Packages: Springer Book Archive