Floorplan sizing by linear programming approximation

In this paper, we present an approximation algorithm by linear programming (LP) for floorplan sizing problem. Given any topological constraints between blocks, we can formulate it as an LP problem with a cost function for the minimum bounding box area. Unlike slicing structures, this approach can ha...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:37th Design Automation Conference, 2000 s. 468 - 471
Hlavní autoři: Chen, Pinhong, Kuh, Ernest S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 01.01.2000
IEEE
Edice:ACM Conferences
Témata:
Applied computing > Physical sciences and engineering > Engineering
Approximation algorithms
Constraint optimization
Cost function
Functional programming
Hardware > Electronic design automation > Physical design (EDA)
Hardware > Emerging technologies
Hardware > Robustness
Hardware > Very large scale integration design
Linear approximation
Linear programming
Mathematics of computing > Mathematical analysis > Functional analysis > Approximation
Mathematics of computing > Mathematical analysis > Mathematical optimization > Continuous optimization > Linear programming
Permission
Theory of computation > Design and analysis of algorithms > Approximation algorithms analysis
Theory of computation > Design and analysis of algorithms > Mathematical optimization > Continuous optimization > Linear programming
Timing
Topology
ISBN:9781581131871, 1581131879
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we present an approximation algorithm by linear programming (LP) for floorplan sizing problem. Given any topological constraints between blocks, we can formulate it as an LP problem with a cost function for the minimum bounding box area. Unlike slicing structures, this approach can handle any topological constraints as well as soft/hard/preplaced blocks, and timing constraints. Empirically, our method needs few iterations to find the optimum solution and shows one order of improvement over previous methods both in run time and capability to handle a larger problem size even on a very limited computing resource PC.
Bibliografie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9781581131871
1581131879
DOI:10.1145/337292.337547