Abstract: In this paper, we introduce a model for the speed scaling setting in the framework of explorable uncertainty. In the model, each job has a release time, a deadline and an unknown workload that can be revealed to the algorithm only after executing a query that induces a given additional job-dependent load. Alternatively, the job may be executed without any query, but in that case its workload is equal to a given upper bound. This assumption is motivated for instance in applications like code optimization, or file compression. We study the problem of minimizing the overall energy consumption for executing all the jobs in their time windows. We also consider the related problem of minimizing the maximum speed used by the algorithm. We present lower and upper bounds for both the offline case, where all the jobs are known in advance, and the online case, where the jobs arrive over time. We start with the single machine setting and we finally deal with the more general case where multiple identical parallel machines are available. © 2021 ACM.

Cite: Bampis E. , Dogeas K. , Kononov A. , Lucarelli G. , Pascual F.
Speed scaling with explorable uncertainty
In compilation SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. 2021. – C.83-93. DOI: 10.1145/3409964.3461812 Scopus OpenAlex

Identifiers:

Scopus:	2-s2.0-85109511697
OpenAlex:	W3174236778

Citing:

DB	Citing
Scopus	2

Altmetrics: