电邮这篇文章 Ant algorithms for scheduling computations in data centers
- 作者: Kostenko V.A.1, Plakunov A.V.1
-
隶属关系:
- Faculty of Computational Mathematics and Cybernetics
- 期: 卷 41, 编号 1 (2017)
- 页面: 44-50
- 栏目: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176173
- DOI: https://doi.org/10.3103/S0278641917010034
- ID: 176173
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
V. Kostenko
Faculty of Computational Mathematics and Cybernetics
编辑信件的主要联系方式.
Email: kost@cs.msu.su
俄罗斯联邦, Moscow, 119991
A. Plakunov
Faculty of Computational Mathematics and Cybernetics
Email: kost@cs.msu.su
俄罗斯联邦, Moscow, 119991
补充文件
