An exact algorithm for wirelength optimal placements in VLSI design
| Autor: | Jan Schneider, Stefan Hougardy, J. Funke |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Very-large-scale integration
Mathematical optimization 021103 operations research 0211 other engineering and technologies Hardware_PERFORMANCEANDRELIABILITY 02 engineering and technology Floorplan Exact algorithm Hardware and Architecture Hardware_INTEGRATEDCIRCUITS 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Electrical and Electronic Engineering Software Rectangle packing Mathematics Block (data storage) |
| Zdroj: | Integration. 52:355-366 |
| ISSN: | 0167-9260 |
| DOI: | 10.1016/j.vlsi.2015.07.001 |
| Popis: | We present a new algorithm designed to solve floorplanning problems optimally. More precisely, the algorithm finds solutions to rectangle packing problems which globally minimize wirelength and avoid given sets of blocked regions. We present the first optimal floorplans for 3 of the 5 intensely studied MCNC block packing instances and a significantly larger industrial instance with 27 rectangles and thousands of nets. Moreover, we show how to use the algorithm to place larger instances that cannot be solved optimally in reasonable runtime. HighlightsAn algorithm to compute provably wirelength-optimal floorplans.The first wirelength-optimal solutions to 3 of the 5 MCNC block packing benchmarks.An optimal floorplan for a real-life instance with 27 rectangles.A framework using our algorithm that finds good solutions to larger instances. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect