云计算中的动态资源分配,效率接近最优
Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency
摘要:
云计算激发了人们对新消费模型下的资源分配问题的新兴趣。一个共同的目标是在具有不同需求模式以及不同服务质量要求的不同用户之间共享资源,例如CPU或I/O带宽。为了确保这些服务需求,云产品通常在提供商和用户之间提供服务水平协议(SLA)。SLA指定用户有权使用的资源量。在许多云环境中,提供商希望在高利用率下操作资源,同时尊重各个SLA。在这两个目标之间通常存在折衷;例如,可以通过将资源从空闲用户转移到“清道夫”工作负载来提高利用率,但存在前者随后再次变为活动的风险。我们研究这个基本的权衡,制定一个资源分配模型,捕捉云计算系统的基本属性,包括SLA,高度有限的反馈系统的状态,可变和不可预测的输入序列。我们的主要结果是一个简单而实用的算法,实现上述两个目标的性能接近最优。首先,即使与全知的离线动态优化相比,我们也保证了资源的近乎最佳利用。其次,我们同时满足所有单个SLA,误差很小。主要的算法工具是一个乘性的权重更新算法,和一个原始-对偶参数,以获得其保证。我们还提供了真实数据的数值验证,以证明我们的算法在实际应用中的性能。
英文摘要:
Cloud computing has motivated renewed interest in resource allocation problems with new consumption models. A common goal is to share a resource, such as CPU or I/O bandwidth, among distinct users with different demand patterns as well as different quality of service requirements. To ensure these service requirements, cloud offerings often come with a service level agreement (SLA) between the provider and the users. An SLA specifies the amount of a resource a user is entitled to utilize. In many cloud settings, providers would like to operate resources at high utilization while simultaneously respecting individual SLAs. There is typically a tradeoff between these two objectives; for example, utilization can be increased by shifting away resources from idle users to "scavenger" workload, but with the risk of the former then becoming active again. We study this fundamental tradeoff by formulating a resource allocation model that captures basic properties of cloud computing systems, including SLAs, highly limited feedback about the state of the system, and variable and unpredictable input sequences. Our main result is a simple and practical algorithm that achieves near-optimal performance on the above two objectives. First, we guarantee nearly optimal utilization of the resource even if compared to the omniscient offline dynamic optimum. Second, we simultaneously satisfy all individual SLAs up to a small error. The main algorithmic tool is a multiplicative weight update algorithm, and a primal-dual argument to obtain its guarantees. We also provide numerical validation on real data to demonstrate the performance of our algorithm in practical applications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。