GLOBAL OPTIMIZATION ALGORITHMS FOR CHIP LAYOUT AND COMPACTION

The package planning (chip layout and compaction) problem can be stated in terms of an optimization problem. The goal is to find the relative placement and shapes of the chips in a way that minimizes the total chip area subject to linear and nonlinear constraints. The constraints arise from geometri...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Engineering optimization Ročník 25; číslo 2; s. 131 - 154
Hlavní autoři:	DORNEICH, MICHAEL C., SAHINIDIS, NIKOLAOS V.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Taylor & Francis Group 01.10.1995
Témata:	branch-and-reduce chip layout and compaction mixed-integer nonlinear programming package planning
ISSN:	0305-215X, 1029-0273
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í:	The package planning (chip layout and compaction) problem can be stated in terms of an optimization problem. The goal is to find the relative placement and shapes of the chips in a way that minimizes the total chip area subject to linear and nonlinear constraints. The constraints arise from geometric design rules, distance and connectivity requirements between various components, area and communication costs and other designer-specified requirements. The problem has been addressed in various settings. It is of unusual computational difficulty due to the nonconvexities- involved. This paper presents a new mixed-integer nonlinear programming formulation for simultaneous chip layout and two-dimensional compaction. Global optimization algorithms are developed for this model as well as for an existing formulation for the chip compaction problem. These algorithms are implemented with the global optimization software BARON and illustrated by solving several example problems.
ISSN:	0305-215X 1029-0273
DOI:	10.1080/03052159508941259