Virtual Machine Resource Allocation for Service Hosting on Heterogeneous Distributed Platforms

We propose algorithms for allocating multiple resources to competing services running in virtual machines on heterogeneous distributed platforms. We develop a theoretical problem formulation and compare these algorithms via simulation experiments based in part on workload data supplied by Google. Ou...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 IEEE 26th International Parallel and Distributed Processing Symposium s. 786 - 797
Hlavní autoři: Stillwell, M., Vivien, F., Casanova, H.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2012
Témata:
Aggregates
cluster
Greedy algorithms
heterogeneous
Random access memory
Resource management
scheduler
Sorting
vector packing
Vectors
virtual machine
Virtual machining
ISBN:1467309753, 9781467309752
ISSN:1530-2075
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We propose algorithms for allocating multiple resources to competing services running in virtual machines on heterogeneous distributed platforms. We develop a theoretical problem formulation and compare these algorithms via simulation experiments based in part on workload data supplied by Google. Our main finding is that vector packing approaches proposed in the homogeneous case can be extended to provide high-quality solutions in the heterogeneous case, and combined to provide a single efficient algorithm. We also consider the case when there may be bounded errors in estimates of performance-related resource needs. We provide a heuristic for compensating for such errors that performs well in simulation, as well as a proof of the worst-case competitive ratio for the single-resource, single-node case when there is no bound on the error.
ISBN:1467309753
9781467309752
ISSN:1530-2075
DOI:10.1109/IPDPS.2012.75