Optimizing placements of workloads on multiple platforms as a service based on costs and service levels

A computer program product for optimizing placements of multiple workloads on multiple platforms, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by one or more processors, the program instructions executable to:

• map, for each respective workload of the multiple workloads, a respective platform index in a workload-platform matrix, the respective platform index identifying a respective platform of the multiple platforms that yields a respective lowest cost for running the respective workload;
• execute an iterative process for solving an optimization problem to find optimal placements of the multiple workloads on the multiple platforms, steps of each iteration including:
• determine, for each respective workload of the multiple workloads, whether running the respective workload on the identified respective platform satisfies mandatory constraints regarding budgets for running the respective workload on the identified respective platform, platform eligibility for running the respective workload, and platform resource capacities;
• in response to determining that, for each respective workload of the multiple workloads, running the respective workload on the identified respective platform satisfies the mandatory constraints,
• check, for each respective workload of the multiple workloads, a best effort constraint regarding required durations to complete the respective workload by the identified respective platform;
• and
• determine whether at least one or more workloads of the multiple workloads do not satisfy the best effort constraint;
• in response to determining that the at least one or more workloads of the multiple workloads do not satisfy the best effort constraint,
• determine, for each workload of the at least one or more workloads, a respective candidate platform of the multiple platforms that yields the respective lowest cost and enables the best effort constraint to be satisfied,
• determine, for each workload of the at least one or more workloads, a respective upgraded platform index in the workload-platform matrix, the respective upgraded platform index identifying the respective candidate platform of the multiple platforms,
• calculate, for each workload of the at least one or more workloads, an upgraded cost, and
• in response to determining that there is a workload in the at least one or more workloads that has a respective candidate platform of the multiple platforms that enables the best effort constraint to be satisfied,
• select, from the at least one or more workloads, a workload that has a lowest upgraded cost and
• map the workload that has the lowest upgraded cost to the respective upgraded platform index in the workload-platform matrix;
• in response to determining that the at least one or more workloads contain no workload with a respective candidate platform of the multiple platforms that can enable the best effort constraint to be satisfied, output current placements as the optimal placements of the multiple workloads on the multiple platforms, wherein the current placements are determined in a current iteration without upgrading platform indexes;
• for each respective workload of the multiple workloads, determine whether the respective workload is running and in response to determining that the respective workload is running on a nonoptimal platform, migrate the respective workload according to the optimal placements.

A computer system for optimizing placements of multiple workloads on multiple platforms, the computer system comprising one or more processors, one or more computer readable tangible storage devices, and program instructions stored on at least one of the one or more computer readable tangible storage devices for execution by at least one of the one or more processors, the program instructions executable to:

• map, for each respective workload of the multiple workloads, a respective platform index in a workload-platform matrix, the respective platform index identifying a respective platform of the multiple platforms that yields a respective lowest cost for running the respective workload;
• execute an iterative process for solving an optimization problem to find optimal placements of the multiple workloads on the multiple platforms, steps of each iteration including:
• determine, for each respective workload of the multiple workloads, whether running the respective workload on the identified respective platform satisfies mandatory constraints regarding budgets for running the respective workload on the identified respective platform, platform eligibility for running the respective workload, and platform resource capacities;
• in response to determining that, for each respective workload of the multiple workloads, running the respective workload on the identified respective platform satisfies the mandatory constraints,
• check, for each respective workload of the multiple workloads, a best effort constraint regarding required durations to complete the respective workload by the identified respective platform;
• and
• determine whether at least one or more workloads of the multiple workloads do not satisfy the best effort constraint;
• in response to determining that the at least one or more workloads of the multiple workloads do not satisfy the best effort constraint,
• determine, for each workload of the at least one or more workloads, a respective candidate platform of the multiple platforms that yields the respective lowest cost and enables the best effort constraint to be satisfied,
• determine, for each workload of the at least one or more workloads, a respective upgraded platform index in the workload-platform matrix, the respective upgraded platform index identifying the respective candidate platform of the multiple platforms,
• calculate, for each workload of the at least one or more workloads, an upgraded cost, and
• in response to determining that there is a workload in the at least one or more workloads that has a respective candidate platform of the multiple platforms that enables the best effort constraint to be satisfied,
• select, from the at least one or more workloads, a workload that has a lowest upgraded cost and
• map the workload that has the lowest upgraded cost to the respective upgraded platform index in the workload-platform matrix;
• in response to determining that the at least one or more workloads contain no workload with a respective candidate platform of the multiple platforms that can enable the best effort constraint to be satisfied, output current placements as the optimal placements of the multiple workloads on the multiple platforms, wherein the current placements are determined in a current iteration without upgrading platform indexes;
• for each respective workload of the multiple workloads, determine whether the respective workload is running and in response to determining that the respective workload is running on a nonoptimal platform, migrate the respective workload according to the optimal placements.

A system of multiple platforms, comprising:

• multiple workloads, comprising pending workloads and running workloads;
• the multiple platforms, comprising remote platforms and local platforms;
• a system for mapping the multiple workloads and the multiple platforms;
• the system for mapping the multiple workloads and the multiple platforms comprising one or more processors, one or more computer readable tangible storage devices, and program instructions stored on at least one of the one or more computer readable tangible storage devices for execution by at least one of the one or more processors, the program instructions executable to:
• map, for each respective workload of the multiple workloads, a respective platform index in a workload-platform matrix, the respective platform index identifying a respective platform of the multiple platforms that yields a respective lowest cost for running the respective workload;
• execute an iterative process for solving an optimization problem to find optimal placements of the multiple workloads on the multiple platforms, steps of each iteration including:
• determine, for each respective workload of the multiple workloads, whether running the respective workload on the identified respective platform satisfies mandatory constraints regarding budgets for running the respective workload on the identified respective platform, platform eligibility for running the respective workload, and platform resource capacities;
• in response to determining that, for each respective workload of the multiple workloads, running the respective workload on the identified respective platform satisfies the mandatory constraints,
• check, for each respective workload of the multiple workloads, a best effort constraint regarding required durations to complete the respective workload by the identified respective platform;
• and
• determine whether at least one or more workloads of the multiple workloads do not satisfy the best effort constraint;
• in response to determining that the at least one or more workloads of the multiple workloads do not satisfy the best effort constraint,
• determine, for each workload of the at least one or more workloads, a respective candidate platform of the multiple platforms that yields the respective lowest cost and enables the best effort constraint to be satisfied,
• determine, for each workload of the at least one or more workloads, a respective upgraded platform index in the workload-platform matrix, the respective upgraded platform index identifying the respective candidate platform of the multiple platforms,
• calculate, for each workload of the at least one or more workloads, an upgraded cost, and
• in response to determining that there is a workload in the at least one or more workloads that has a respective candidate platform of the multiple platforms that enables the best effort constraint to be satisfied,
• select, from the at least one or more workloads, a workload that has a lowest upgraded cost and
• map the workload that has the lowest upgraded cost to the respective upgraded platform index in the workload-platform matrix;
• in response to determining that the at least one or more workloads contain no workload with a respective candidate platform of the multiple platforms that can enable the best effort constraint to be satisfied, output current placements as the optimal placements of the multiple workloads on the multiple platforms, wherein the current placements are determined in a current iteration without upgrading platform indexes;
• for each respective workload of the multiple workloads, determine whether the respective workload is running and in response to determining that the respective workload is running on a nonoptimal platform, migrate the respective workload according to the optimal placements.