Optimal Resource Scheduling and Allocation in Distributed Computing Systems
Optimal Resource Scheduling and Allocation in Distributed Computing Systems
复制标题
DOI：
10.23919/acc53348.2022.9867340
复制
发表时间：
2021-10
期刊：
影响因子：
--
通讯作者：
Wei Ren;E. Vlahakis;N. Athanasopoulos;R. Jungers
中科院分区：
文献类型：
--
作者：
Wei Ren;E. Vlahakis;N. Athanasopoulos;R. Jungers
分布式计算系统的本质是如何调度进入的请求以及如何分配所有计算节点以最小化时间和计算成本。本文提出了一种基于代价感知的分布式计算系统最优调度与分配策略，同时最小化了响应时间和服务代价的代价函数。首先，基于所提出的代价函数，我们同时推导出最优请求调度策略和最优资源分配策略。其次，考虑到请求到达对调度策略的影响，提出了加性增加乘性减少(AIMD)机制对请求到达与调度之间的关系进行建模。具体地说，可以设计AIMD参数，使得导出的最优策略仍然有效。
The essence of distributed computing systems is how to schedule incoming requests and how to allocate all computing nodes to minimize both time and computation costs. In this paper, we propose a cost-aware optimal scheduling and allocation strategy for distributed computing systems while minimizing the cost function including response time and service cost. First, based on the proposed cost function, we derive the optimal request scheduling policy and the optimal resource allocation policy synchronously. Second, considering the effects of incoming requests on the scheduling policy, the additive increase multiplicative decrease (AIMD) mechanism is implemented to model the relation between the request arrival and scheduling. In particular, the AIMD parameters can be designed such that the derived optimal strategy is still valid.