| Autor: |
Nina Kulieva, Daria Zaruba, Dmitry Zaporozhets |
| Rok vydání: |
2019 |
| Předmět: |
|
| Zdroj: |
2019 International Russian Automation Conference (RusAutoCon). |
| DOI: |
10.1109/rusautocon.2019.8867633 |
| Popis: |
The paper deals with a hybrid algorithm to solve one of the main problem of the VLSI design - the placement problem. This problem is NP-complete and does not have a deterministic algorithm for its solution. Hence, the development of new search methods is an urgent task. Among a variety of probabilistic methods, bioinspired algorithms have already shown its effectiveness for combinatorial optimization problems solving. The paper presents a hybrid bioinspired algorithm for VLSI fragments placement. The authors suggest an approach based on a bee algorithm at the first level for searching a diversifying and parallel genetic algorithm at the second level to provide a depth search in the vicinity of the points. The problem formulation and detailed description of algorithm steps are presented. Series of computational experiments were carried out in which theoretical dependences of obtained optimal and quasi-optimal solutions on the values of input parameters were confirmed empirically. The comparison was carried out with known analogous algorithms for VLSI fragments placement: Capo 8.6, Feng Shui 2.0, Dragon 2.23. The increase in the solutions quality is on the average 19 per cent. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
