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

球入箱:严格的容量和边缘重量

Balls into Bins: strict Capacities and Edge Weights

Ankur Sahai

摘要:

我们探索了一种新的理论模型,用于研究分布式存储管理系统的性能,其中数据中心的容量有限(与用户请求的存储空间相比)。诸如球入仓(用于负载均衡)的现有方案既不考虑仓(消费者)容量(多个球进入仓),也不考虑在球(生产者请求)被分配给仓之后系统的未来性能,并且将球的数量限制为仓的数量的函数。我们的问题包括在一个完整的二分图中找到一个最佳的分配的在线生产者请求的消费者(通过加权边),同时确保分配给消费者的请求的总大小是有限的,其容量。在该模型中,用于测量性能的度量是在边缘(负载)上分配的请求的加权和及其相应权重的(最小化)。我们首先探讨了最佳的离线算法,然后对不同的在线技术进行竞争分析。利用健忘的对手。LP和原始对偶算法用于在O(r*n)时间内计算最优离线解(其中r和n分别是请求和消费者的数量),而随机算法用于在线情况。对于具有相等消费者容量的简化模型,使用具有相等概率的算法实现平均情况下的竞争比AVG(d)/ MIN(d)(其中d是边权重/距离),该算法用于选择任何可用边,运行时间为$O(r)$。在将模型扩展到任意消费者容量时,我们显示了平均情况竞争比AVG(d*c)/(AVG(c)*MIN(d))。

英文摘要:

We explore a novel theoretical model for studying the performance of distributed storage management systems where the data-centers have limited capacities (as compared to storage space requested by the users). Prior schemes such as Balls-into-bins (used for load balancing) neither consider bin (consumer) capacities (multiple balls into a bin) nor the future performance of the system after, balls (producer requests) are allocated to bins and restrict number of balls as a function of the number of bins. Our problem consists of finding an optimal assignment of the online producer requests to consumers (via weighted edges) in a complete bipartite graph while ensuring that the total size of request assigned on a consumer is limited by its capacity. The metric used to measure the performance in this model is the (minimization of) weighted sum of the requests assigned on the edges (loads) and their corresponding weights. We first explore the optimal offline algorithms followed by competitive analysis of different online techniques. Using oblivious adversary. LP and Primal-Dual algorithms are used for calculating the optimal offline solution in O(r*n) time (where r and n are the number of requests and consumers respectively) while randomized algorithms are used for the online case. For the simplified model with equal consumer capacities an average-case competitive ratio of AVG(d) / MIN(d) (where d is the edge weight / distance) is achieved using an algorithm that has equal probability for selecting any of the available edges with a running time of $O(r)$. In the extending the model to arbitrary consumer capacities we show an average case competitive ratio of AVG(d*c) / (AVG(c) *MIN(d)).

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

↑