论文标题
最佳资源调度和分配允许的过度安排
Optimal Resource Scheduling and Allocation under Allowable Over-Scheduling
论文作者
论文摘要
本文研究了允许的过度安排下的最佳计划和资源分配。制定了一个优化问题，其中嵌入了过度安排的问题，我们得出了一个最佳解决方案，可以通过新的添加剂增加乘法减少（AIMD）算法来实现。在将类似AIMD的调度机制描述为开关系统之后，我们根据对称矩阵的关节光谱半径显示了该方案的收敛性，并提出了两种将最佳AIMD调整拟合到最佳解决方案的方法。最后，我们通过一个说明性示例演示了总体最佳设计策略。
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.
