Minimum Cost Maximum Flow Algorithm for Dynamic Resource Allocation in Clouds

Authors:
Makhlouf Hadji;Djamal Zeghlache
Affiliations:
-;-
Venue:
CLOUD '12 Proceedings of the 2012 IEEE Fifth International Conference on Cloud Computing
Year:
2012

Citing 0
Cited 3

Autonomic resource provisioning in cloud systems with availability goals

Proceedings of the 2013 ACM Cloud and Autonomic Computing Conference
Scheduling jobs in the cloud using on-demand and reserved instances

Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
An energy and deadline aware resource provisioning, scheduling and optimization framework for cloud systems

Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

A minimum cost maximum flow algorithm is proposed for resources(e.g. virtual machines) placement in clouds confronted to dynamic workloads and flows variations. The algorithm is compared to an exact method generalizing the classical Bin-Packing formulation using a linear integer program. A directed graph is used to model the allocation problem for cloud resources organized in a finite number of resource types; a common practice in cloud services. Providers can use the minimum cost maximum flow algorithm to opportunistically select the most appropriate physical resources toserve applications or to ensure elastic platform provisioning. The modified Bin-Packing algorithm is used to benchmark the minimum cost maximum flow solution. The latter combined with a prediction mechanism to handle dynamic variations achieves near optimal performance.