Ant algorithms for scheduling computations in data centers

Аннотация

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.