Proceedings Article10.1145/640000.640030
Constrained "Modern" Floorplanning
Yan Feng,Dinesh P. Mehta,H.H. Yang +2 more
- 06 Apr 2003
- pp 128-135
TL;DR: Three algorithms (BFS, IBFS, CBFS) based on using BFS numbers to assign costs in a min-cost max-flow network formulation are presented, demonstrating that BFS and IBFS are fast and obtain zero whitespace floorplans.
read more
Abstract: This paper presents algorithms for a constrained version of the "modern" floorplanning problem proposed by Kahng in "Classical Floorplanning Harmful?" [1]. Specically, the constrained modern floorplanning problem (CMFP) is suitable when die-size is fixed, modules are permitted to have rectilinear shapes, and, in addition, the approximate relative positions of the modules are known. This formulation is particularly useful in two scenarios: (1) assisting an expert floorplan architect in a semi-automated floorplan methodology and (2) in incremental floorplanning. CMFP is shown to be NP hard. An algorithm based on a max-flow network formulation quickly identifies input constraints that are impossible to meet, thus permitting the floorplan architect to modify these constraints. Three algorithms (BFS, IBFS, CBFS) based on using BFS numbers to assign costs in a min-cost max-flow network formulation are presented. Experiments on standard benchmarks demonstrate that BFS and IBFS are fast and obtain zero whitespace floorplans.
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
Fixed-outline floorplanning: enabling hierarchical design
Saurabh N. Adya,Igor L. Markov +1 more
TL;DR: This paper studies the fixed-outline floorplan formulation that is more relevant to hierarchical design style and is justified for very large ASICs and SoCs and proposes new objective functions to drive simulated annealing and new types of moves that better guide local search in the new context.
UFO: Unified Convex Optimization Algorithms for Fixed-Outline Floorplanning Considering Pre-Placed Modules
Jai-Ming Lin,Zhi-Xiong Hung +1 more
TL;DR: This paper applies two convex optimization methods, named UFO, for fixed-outline floorplanning, which consists of a global distribution stage and a local legalization stage, which clearly outperforms the results reported in the literature on the GSRC benchmark.
23
UFO: unified convex optimization algorithms for fixed-outline floorplanning
Jai-Ming Lin,Hsi Hung +1 more
- 18 Jan 2010
TL;DR: This paper applies two convex optimization methods, named UFO, for fixed-outline floorplanning, which consists of a global distribution stage and a local legalization stage, which clearly outperforms the results reported in the literature on the GSRC benchmark.
17
Patent
System and method for placement of soft macros
Cornells Van Eijk,Michail Romesis,Roger Carpenter,Philippe Sarrazin +3 more
- 12 Apr 2007
TL;DR: In this paper, an electronic design automation method of placing circuit components of an integrated circuit (IC) is provided, where a synthesized circuit netlist including one or more soft macros is received and a rough global placement of this netlist is performed.
16
Fixed-outline floorplanning using robust evolutionary search
TL;DR: This paper develops an efficient algorithm based on robust evolutionary search and achieves substantially improved success rate and proposes a new approach to handle soft modules to further adjust the generated floorplan to fit into the prescribed chip outline.
11
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
Introduction to Algorithms, 2nd edition.
TH Cormen,CE Leiserson,RL Rivest,Cliff Stein +3 more
- 01 Jan 2001
4K
•Book
Introduction to Algorithms, Second Edition
Ronald L. Rivest,Charles E. Leiserson,Thomas H. Cormen,Clifford Stein +3 more
- 01 Jan 2001
TL;DR: The complexity class P is formally defined as the set of concrete decision problems that are polynomial-time solvable, and encodings are used to map abstract problems to concrete problems.
2.9K