General Questions of Automated Design and Engineering

Malioukov, Sergey P.; Kureichik, Vladimir; Malioukov, Alexander S.

doi:10.1007/978-3-540-85281-0_1

Cited by 14 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The optimization of this parameter comes to minimization of the critical connection length. The critical connection is an electrical circuit with a maximum connection length [1][2][3][5][6][7][8].…”

Section: Problem Definitionmentioning

confidence: 99%

“…The technological development on a submicrometer scale caused the emergence of new physical phenomena. Therefore, the design of new heuristics algorithms to solve engineering problems is a topical issue of modern engineering [1][2][3]. In this paper the authors suggest a solution of the VLSI components' placement.…”

Section: Introductionmentioning

confidence: 99%

“…So, to obtain results in the polynomial time it is necessary to develop the heuristics allowing to find quasioptimal solutions. Evolutionary and bioinspired search mechanisms proved to be effective in terms of computer aided design [2,4,5]. To solve the VLSI components placement problem a hierarchical approach on the basis of the bioinspired search is designed.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Hierarchical Approach for VLSI Components Placement

Zaporozhets

Zaruba

Kureichik

2015

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Abstract.To solve the problem of VLSI components' placement a modified hierarchical approach is proposed. This approach consists of three levels. At the first level a preliminary decomposition of search space with the use of evolutionary algorithms is performed. Geometric parameters of each group are determined by the total area of its constituent components. At the second level VLSI components are placed within decomposition groups on the basis of the modified genetic algorithm. At the third level decomposition groups are placed within a connection field using genetic search methods. The suggested methods of the encoding and decoding of alternative solutions enable the authors to perform genetic procedures. These methods consist in using the reverse Polish notation. A computational experiment, which confirmed the theoretical estimates of the performance and efficiency of the developed algorithms, was carried out. The hierarchical algorithm was compared with classical methods and the bioinspired search. The time complexity of the algorithm is represented as O (n log n).

show abstract

Section: Problem Definitionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation