arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1310.5255cs.DC
收藏

内存约束下的高效鲁棒云资源分配算法

Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints

Olivier Beaumont, Lionel Eyraud-Dubois, Paul Renaud-Goud

摘要:

我们考虑在云中服务的鲁棒资源分配。更具体地说,我们考虑的是运行相对较小的大型独立服务集的大型公共或私有云平台的情况。这些服务的特征在于它们沿几个维度(CPU、内存等)的需求。以及服务质量要求,这些要求在公共云的情况下通过SLA定义,在私有云的情况下由管理员确定。该服务质量通过对提供者未能分配所需资源量的概率设置上限来定义服务所需的鲁棒性。这个最大的失败概率可以透明地转化为一对(价格,惩罚)。故障确实会影响平台,而恢复能力是通过服务复制来提供的。我们的贡献是双重的。首先,我们提出了一个资源分配策略,其复杂性是对数的资源,这使得它非常有效的大型平台。其次,我们提出了一个有效的算法,基于罕见事件检测技术,以估计分配的鲁棒性,已被证明是P-完全的问题。最后,我们提供了一个分析所提出的策略,通过一组广泛的模拟,无论是在分配的资源的总数和计算分配所需的时间。

英文摘要:

We consider robust resource allocation of services in Clouds. More specifically, we consider the case of a large public or private Cloud platform that runs a relatively small set of large and independent services. These services are characterized by their demand along several dimensions (CPU, memory,...) and by their quality of service requirements, that have been defined through an SLA in the case of a public Cloud or fixed by the administrator in the case of a private Cloud. This quality of service defines the required robustness of the service, by setting an upper limit on the probability that the provider fails to allocate the required quantity of resources. This maximum probability of failure can be transparently turned into a pair (price,penalty). Failures can indeed hit the platform, and resilience is provided through service replication. Our contribution is two-fold. First, we propose a resource allocation strategy whose complexity is logarithmic in the number of resources, what makes it very efficient for large platforms. Second, we propose an efficient algorithm based on rare events detection techniques in order to estimate the robustness of an allocation, a problem that has been proven to be P-complete. Finally, we provide an analysis of the proposed strategy through an extensive set of simulations, both in terms of the overall number of allocated resources and in terms of time necessary to compute the allocation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑