JOURNAL ARTICLE

Deadline constrained scheduling in hybrid clouds with Gaussian processes

Abstract

In hybrid clouds, deciding which workloads to outsource and at what time is far from trivial. The objective of this decision is to maximize the utilization of the internal data center and to minimize outsourcing. Neither all tasks' runtime nor their issue time are known in advance. However, a majority of tasks are always issued automatically during the day, e.g. common batch jobs. This work presents experimental results on different optimization strategies for cost-optimal dynamic scheduling in hybrid cloud environments. We estimate task execution times as random variables over day time from past observations using Heteroscedastic Gaussian Processes (HGP). HGP are suitable in particular for the presented scheduling problem because they not only provide an estimation of a task's mean runtime (as given by standard regression methods), but also the certainty of this estimation. We show that HGP provide an intuitive framework to model a variety of different distributions. The overall results are similar to optimization results with the unknown generating distribution.

Keywords:
Computer science Outsourcing Scheduling (production processes) Cloud computing Distributed computing Gaussian Job shop scheduling Real-time computing Mathematical optimization Embedded system

Metrics

12
Cited By
0.75
FWCI (Field Weighted Citation Impact)
18
Refs
0.84
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Cloud Computing and Resource Management
Physical Sciences →  Computer Science →  Information Systems
Distributed and Parallel Computing Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Gaussian Processes and Bayesian Inference
Physical Sciences →  Computer Science →  Artificial Intelligence
© 2026 ScienceGate Book Chapters — All rights reserved.