Optimal Resource Scheduling and Allocation under Allowable Over-Scheduling
Optimization and Control
2022-04-04 v1 Distributed, Parallel, and Cluster Computing
Systems and Control
Systems and Control
Abstract
This paper studies optimal scheduling and resource allocation under allowable over-scheduling. Formulating an optimisation problem where over-scheduling is embedded, we derive an optimal solution that can be implemented by means of a new additive increase multiplicative decrease (AIMD) algorithm. After describing the AIMD-like scheduling mechanism as a switching system, we show convergence of the scheme, based on the joint spectral radius of symmetric matrices, and propose two methods for fitting an optimal AIMD tuning to the optimal solution derived. Finally, we demonstrate the overall optimal design strategy via an illustrative example.
Cite
@article{arxiv.2204.00038,
title = {Optimal Resource Scheduling and Allocation under Allowable Over-Scheduling},
author = {Wei Ren and Eleftherios Vlahakis and Nikolaos Athanasopoulos and Raphael M. Jungers},
journal= {arXiv preprint arXiv:2204.00038},
year = {2022}
}
Comments
8 pages, 4 figures, submitted to CDC2022. arXiv admin note: text overlap with arXiv:2112.00708