• multi-cloud
• milp
• broker
• allocation
• optimization

The thesis studies a model of resource allocation for Cloud applications that allows using multiple clouds at the same time for a large set of applications.

The model allows resource allocation to be cast as a Mixed/Integer Linear Programming problem, where optimal solutions can be computed subject to various types of platform constraints (e.g. application integrity when mapped across Clouds, resource capacity, application budget) and according to platform parameters (resource and migration costs). The objective functions takes then into account application cost as well as penalties for rejecting/migrating applications.

The model is encoded in the MathProg language, and a software prototype has been built. It exploits standard MILP optimizers GLPK and CBC and a set of ad-hoc tools in Java that allow to focus the optimization on a subset of the available resources and applications. The model and the prototype are evaluated with respect to their effectiveness and running time using a real life dataset made available by Google, tracing the execution of a very large number of Cloud jobs for more than 6 hours.