Ant algorithms for scheduling computations in data centers
- Autores: Kostenko V.A.1, Plakunov A.V.1
-
Afiliações:
- Faculty of Computational Mathematics and Cybernetics
- Edição: Volume 41, Nº 1 (2017)
- Páginas: 44-50
- Seção: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176173
- DOI: https://doi.org/10.3103/S0278641917010034
- ID: 176173
Citar
Resumo
An ant colony algorithm is considered for the problem ofmapping requests onto physical resources of data centers. Results from an experimental study of the properties of the algorithm are presented, and it is compared to algorithms that combine greedy strategies and limited searches.
Palavras-chave
Sobre autores
V. Kostenko
Faculty of Computational Mathematics and Cybernetics
Autor responsável pela correspondência
Email: kost@cs.msu.su
Rússia, Moscow, 119991
A. Plakunov
Faculty of Computational Mathematics and Cybernetics
Email: kost@cs.msu.su
Rússia, Moscow, 119991
Arquivos suplementares
