Abstract
A genetic algorithm is suggested for synthesizing real-time computer systems. The emphasis is on adjusting the algorithm to specific features of the problem and justifying the decisions made. Results of the analysis of the algorithm are also presented. Parameters of the genetic algorithm that provide good solutions are chosen by using a computational experiment.
Similar content being viewed by others
References
Smelyanskii, R.L., A Model of the Operation of Distributed Computer Systems,Vestn. Mosk. Univ., Ser. 15, Vychisl. Mat. Kibern., 1990, no. 3.
Podgornyi, S.A. and Smelyanskii, R.L., On the Synthesis of Computer System Architecture on the Basis of Program Behavior, inVoprosy organizatsii programmnogo obespecheniya i prinyatiya reshenii (Structuring Software and Decision Making), Moscow: Mosk. Gos. Univ., 1993.
Michalewiz, Z.,Genetic Algorithms+Data Structures=Evolution Programs, Springer, 1999, 3rd ed.
Obozrenie prikladnoi matematiki: Evolutsionnye vychisleniya i geneticheskie algoritmy (Survey of Applied Mathematics: Evolution Computations and Genetic Algorithms); Ser. Metody optimizatsii (Optimization Methods), 1996, vol. 3, issue 5.
Holland, J.N.,Adaptation in Natural and Artificial Systems, Ann Arbor: Univ. of Michigan Press, 1975.
Teoriya raspisanii i vychislitel'nye mashiny (Scheduling Theory and Computers), Koffman, E.G., Ed., Moscow: Nauka, 1984.
Kostenko, V.A., Large-Grain Parallelism in Signal Processing Problems,Programmirovanie, 1997, no. 2.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kostenko, V.A., Smelyanskii, R.L. & Trekin, A.G. Synthesizing structures of real-time computer systems using genetic algorithms. Program Comput Soft 26, 281–288 (2000). https://doi.org/10.1007/BF02759322
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02759322