Email this article Ant algorithms for scheduling computations in data centers
- Authors: Kostenko V.A.1, Plakunov A.V.1
-
Affiliations:
- Faculty of Computational Mathematics and Cybernetics
- Issue: Vol 41, No 1 (2017)
- Pages: 44-50
- Section: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176173
- DOI: https://doi.org/10.3103/S0278641917010034
- ID: 176173
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
Keywords
About the authors
V. A. Kostenko
Faculty of Computational Mathematics and Cybernetics
Author for correspondence.
Email: kost@cs.msu.su
Russian Federation, Moscow, 119991
A. V. Plakunov
Faculty of Computational Mathematics and Cybernetics
Email: kost@cs.msu.su
Russian Federation, Moscow, 119991
Supplementary files
