Article

Article title RESEARCH OF ALGORITHMS OF THE AUTOMATED DESIGNING ON THE EXAMPLE OF THE PROBLEM OF SPLITTING VLSI
Authors S.N. Shсheglov
Section SECTION II. AUTOMATION OF DESIGNING
Month, Year 07, 2014 @en
Index UDC 681.3.001.63
DOI
Abstract The paper considers conduct computational experiments in making decisions for the graph models in CAD. discusses research methods aided design algorithms for the problem of VLSI placement. Recently research objectives algorithms to determine the optimal parameters for which algorithms are global or close to it solutions (maxima) in the minimum time, and the proof of their efficiency (optimality), compared with similar algorithms. The stages of experimental studies. Before starting the experiments necessary to determine the order of their execution, due to optimal planning with minimal cost to get all the information about the objects of study. For complex testing of algorithms inspired by nature was considered an example of a specialized program sreday. Its main purpose is to obtain a numerical analysis of integral effectiveness evaluations set of algorithms for decision-making in CAD.

Download PDF

Keywords Computer-aided design; VLSI design; algorithm; optimum; computational experiments; graph models; decision making.
References 1. Norenkov I.P. Osnovy avtomatizirovannogo proektirovaniya [Bases of the automated designing]. Moscow: Izd-vo MGTU im. N.Eh. Baumana, 2006, 448 p.
2. Kureychik V.M., Lebedev B.K., Lebedev V.B. Planirovanie sverkhbolshikh integralnykh skhem na osnove integracii modeley adaptivnogo poiska [Planning of very large scale integrated circuits on the basis of integration models adaptive search], Izvestiya RAN. Teoriya i sistemy upravleniya [Izvestiya of the Russian Academy of Sciences. Theory and control system], 2013, No. 1, pp. 84-101.
3. Gladkov L.A, Kureichik V.V., Kravchenko Yu.A. Evolutionary Algorithm for Extremal Subsets Comprehension in Graphs, World Applied Sciences Journal, 2013, No. 24 (14).
4. Kureychik V.M., Kureychik V.V., Rodzin S.I. Kontseptsiya evolyutsionnykh vychisleniy, inspirirovannykh prirodnymi sistemami [The concept of evolutionary computation, inspired by natural systems], Izvestiya YuFU. Tekhnicheskie nauki [Izvestiya SFedU. Engineering Sciences], 2009, No. 4, pp. 16-25.
5. Kureychik V.M., Lebedev B.K., Lebedev O.B. Gibridnyy algoritm razbieniya na osnove prirodnykh mekhanizmov prinyatiya resheniy [Hybrid partitioning algorithm based on natural mechanisms of decision making], Iskusstvennyy intellekt i prinyatie resheniy [Artificial Intelligence and Decision Making], 2012, pp. 3-15.
6. Kureychik V.M. Modifitsirovannye geneticheskie operatory [Modified genetic operators], Izvestiya YuFU. Tekhnicheskie nauki [Izvestiya SFedU. Engineering Sciences], 2009, No. 12 (101), pp. 7-14.
7. Kureychik V.M. Osobennosti postroeniya sistem podderzhki prinyatiya resheniy [Features of construction of systems of support of decision making], Izvestiya YuFU. Tekhnicheskie nauki [Izvestiya SFedU. Engineering Sciences], 2012, No. 7 (132), pp. 92-98.
8. Kureychik V.V., Kureychik Vl.Vl. Bioinspirirovannyy algoritm razbieniya skhem pri proektirovanii SBIS [Biospherology partitioning algorithm of schemes in the design of VLSI], Izvestiya YuFU. Tekhnicheskie nauki [Izvestiya SFedU. Engineering Sciences], 2013, No. 7 (144), pp. 23-29.
9. Gladkov L.A. Gibridnyy geneticheskiy algoritm resheniya zadachi razmeshcheniya elementov SBIS s ucetom trassiruemosti soedineniy [Hybrid genetic algorithm for solving the problem of placing of elements of VLSI with regard to traceability connections], Vestnik rostovskogo gosudarstvennogo universiteta putey soobtheniya [Herald Rostov State University Railway], 2011, No. 3, pp. 58-66.
10. Kuliev Eh.V., Lezhebokov A.A. Issledovanie kharakteristik gibridnogo algoritma razmeshcheniya [Investigation of characteristics of hybrid algorithm for accommodation], Izvestiya YuFU. Tekhnicheskie nauki [Izvestiya SFedU. Engineering Sciences], 2013, No. 3 (140), pp. 255-261.

Comments are closed.