Journal Article10.1109/43.149770
Optimal floorplan area optimization
Ting-Chi Wang,D.F. Wong +1 more
69
TL;DR: Experimental results indicate that the authors' algorithm is efficient and capable of successfully handling large floor plans and running time is substantially less than that of the Wimer algorithm.
read more
Abstract: An optimal algorithm for the floorplan area optimization problem is presented. The algorithm is based on an extension of the technique of L. Stockmeyer (1983). Experimental results indicate that the authors' algorithm is efficient and capable of successfully handling large floor plans. The algorithm is compared with the branch-and-bound optimal algorithm of S. Wimer et al. (ibid., vol.8, no.2, p.139-45, 1989). The running time of the present algorithm is substantially less than that of the Wimer algorithm. For several examples where the Wimer algorithm ran for days and did not terminate, the present algorithm produced optimal solutions in a few seconds. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Classical floorplanning harmful
Andrew B. Kahng
- 01 May 2000
TL;DR: In this article, the authors point out several examples, including the preoccupation with packing-driven, as opposed to connectivity-driven problem formulations and benchmarking standards, and the lack of attention to algorithm scalability, fixed-die layout requirements, and overall RTL-down methodology context.
Handling soft modules in general nonslicing floorplan using Lagrangian relaxation
TL;DR: This paper shows how this problem can be solved optimally by geometric programming using the Lagrangian relaxation technique, and how this technique will be applicable to other floorplanning algorithms that use constraint graphs to find module positions in the final packing.
Area minimization for floorplans
Peichen Pan,C. L. Liu +1 more
TL;DR: Compared with the branch-and-bound algorithm of Wimer et al (1989), which does not have a nontrivial performance bound, the methods are provably better than an exhaustive method for all the examples the authors examined.
46
A fixed-die floorplanning algorithm using an analytical approach
Yong Zhan,Yan Feng,Sachin S. Sapatnekar +2 more
- 24 Jan 2006
TL;DR: This paper presents an analytical floorplanning algorithm that can be used to efficiently pack soft modules into a fixed die and the efficiency is much higher than that of the simulated annealing based algorithms for benchmarks containing a large number of modules.
Hybrid floorplanning based on partial clustering and module restructuring
Takayuki Yamanouchi,kazuo Tamakashi,Takashi Kambe +2 more
- 10 Nov 1996
TL;DR: Two hierarchical strategies for avoiding local optima during iterative improvement are proposed: (1) Partial Clustering, and (2) Module Restructuring, which are successful in reducing both area and wire length in addition to reducing the computational time required for optimization.
References
•Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
10.6K
Automatic Floorplan Design
Ralph H. J. M. Otten
- 01 Jan 1982
TL;DR: The problem of allocating area to modules at the highest level of a top-down decomposition is treated and a theorem of Schoenberg is applied to obtain a good embedding of the module space into the plane.
351
A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation
Ulrich Lauther
- 25 Jun 1979
TL;DR: A new placement algorithm for general cell assemblies is presented which combines the ideas of polar graph representation and min-cut placement and the various methods for placement improvement and global routing.
194
Efficient Floorplan Area Optimization
D. F. Wong,P. S. Sakhamuri +1 more
- 01 Jun 1989
TL;DR: An algorithm for general hierarchical floorplan area optimization that combines the curve-adding technique used in the case of slicing floorplans and a new technique that computes shape curves by iterative modification of the shape and dimensions of individual modules is presented.
42
An algorithm for hierarchical floorplan design
D.F. Wong
- 05 Nov 1989
TL;DR: A floorplan design algorithm is presented which is based on a new representation of order-5 hierarchical floorplan by normalized 2-5 Polish expressions, and an efficient floorplan area optimization algorithm for general hierarchical floorplans that makes the cost function evaluations possible.
17