Matheuristic Local Search for the Placement of Analog Integrated Circuits

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F24%3A00370658" target="_blank" >RIV/68407700:21730/24:00370658 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21230/24:00370658

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-031-49662-2_10" target="_blank" >https://doi.org/10.1007/978-3-031-49662-2_10</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-031-49662-2_10" target="_blank" >10.1007/978-3-031-49662-2_10</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Matheuristic Local Search for the Placement of Analog Integrated Circuits

Popis výsledku v původním jazyce

The suboptimal physical design of the integrated circuits may not only increase the manufacturing costs due to the larger size of the chip but can also impact its performance by placing interconnected rectangular devices too far from each other. In the domain of Analog and Mixed-Signal Integrated Circuits (AMS ICs), placement automation is lacking behind its digital counterpart, mainly due to the variety of components and complex constraints the placement needs to satisfy. Integer Linear Programming (ILP) is a suitable approach to modeling the placement problem for AMS ICs. However, not even state-of-the-art solvers can create high-quality placements for large problem instances. In this paper, we study how to improve the results of our previous ILP model, first by introducing additional constraints and second by using matheuristics. Given the initial solution we obtain using our original ILP model, we use the solver to perform a local search. We try to improve the criterion by considering only a few spatially close rectangles while keeping the rest of the placement fixed. This local search approach enables us to significantly improve the quality of instances whose solution space we could not sufficiently explore before, even when the computation time reserved for the matheuristic is limited. Finally, we evaluate our revised approach on synthetically generated instances containing more than 200 independent rectangles and on real-life problems.

Název v anglickém jazyce

Matheuristic Local Search for the Placement of Analog Integrated Circuits

Popis výsledku anglicky

The suboptimal physical design of the integrated circuits may not only increase the manufacturing costs due to the larger size of the chip but can also impact its performance by placing interconnected rectangular devices too far from each other. In the domain of Analog and Mixed-Signal Integrated Circuits (AMS ICs), placement automation is lacking behind its digital counterpart, mainly due to the variety of components and complex constraints the placement needs to satisfy. Integer Linear Programming (ILP) is a suitable approach to modeling the placement problem for AMS ICs. However, not even state-of-the-art solvers can create high-quality placements for large problem instances. In this paper, we study how to improve the results of our previous ILP model, first by introducing additional constraints and second by using matheuristics. Given the initial solution we obtain using our original ILP model, we use the solver to perform a local search. We try to improve the criterion by considering only a few spatially close rectangles while keeping the rest of the placement fixed. This local search approach enables us to significantly improve the quality of instances whose solution space we could not sufficiently explore before, even when the computation time reserved for the matheuristic is limited. Finally, we evaluate our revised approach on synthetically generated instances containing more than 200 independent rectangles and on real-life problems.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Operations Research and Enterprise Systems, ICORES 2022, ICORES 2023

ISBN

978-3-031-49661-5

ISSN

1865-0929

e-ISSN

1865-0937

Počet stran výsledku

23

Strana od-do

178-200

Název nakladatele

Springer, Cham

Místo vydání

—

Místo konání akce

Lisabon

Datum konání akce

19. 2. 2023

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—