Algorithm for resource allocation in data centers with independent schedulers for different types of resources

Abstract

An algorithm for assigning requests to physical recourses for data centers with independent schedulers for different types of resources (computational resources, network resources, and data stor ages) is considered. This algorithm is based on the combination of greedy and limited search strategies. The algorithm provides a required balance between the computational complexity and quality of assignments by limiting the maximum allowed search depth. Theoretical and experimental results of investigating its features are presented.

Resource allocation algorithm in data centers with a unified scheduler for different types of resources

“…The first algorithm combining the use of greedy and limited search strategies is most effective when computational and data storage resources are critical. This algorithm is thoroughly described in [5].…”

Congestion Elimination on Data Storages Network Interfaces in Datacenters

“…There are three algorithms of resource allocation in datacenters, presented in [17][18][19][20], that uses the replication procedure for congestion elimination: algorithm with the unified scheduler, algorithm with the individual schedulers and ant colony algorithm. In these algorithms replication procedure is called if virtual link route between virtual machine and storage element is failed to be build with respect to required virtual link bandwidth.…”

“…In [17][18][19][20] various algorithms to resource allocation in the datacenters with self-organizing cloud platforms are presented that satisfy all characteristics mentioned above.…”