arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1109.6925cs.DCcs.DS
收藏

具有权重和速度的分布式自私负载均衡

Distributed Selfish Load Balancing with Weights and Speeds

C. P. J. Adolphs, P. Berenbrink

摘要:

在本文中,我们考虑在自私的客户端的上下文中的邻域负载均衡。我们假设有一个由n个处理器和m个任务组成的网络。处理器可以具有不同的速度,并且任务可以具有不同的权重。每个任务都由自私的用户控制。用户的目标是将他/她的任务分配给具有最小负载的处理器。我们重新回顾了[6]中介绍的并发概率协议,该协议在顺序轮中工作。在每一轮中,每个任务被允许查询一个随机选择的相邻处理器的负载。如果该负载较小,则任务将以适当选择的概率迁移到该处理器。使用谱图理论的技术,我们获得了近似和精确纳什均衡的预期收敛时间的上界,这些上界明显优于[6]中的先前结果。我们显示结果的统一任务的非统一的处理器和一般情况下,任务有不同的权重和机器的速度。据我们所知,这些是这种一般设置的第一个结果。

英文摘要:

In this paper we consider neighborhood load balancing in the context of selfish clients. We assume that a network of n processors and m tasks is given. The processors may have different speeds and the tasks may have different weights. Every task is controlled by a selfish user. The objective of the user is to allocate his/her task to a processor with minimum load. We revisit the concurrent probabilistic protocol introduced in [6], which works in sequential rounds. In each round every task is allowed to query the load of one randomly chosen neighboring processor. If that load is smaller the task will migrate to that processor with a suitably chosen probability. Using techniques from spectral graph theory we obtain upper bounds on the expected convergence time towards approximate and exact Nash equilibria that are significantly better than the previous results in [6]. We show results for uniform tasks on non-uniform processors and the general case where the tasks have different weights and the machines have speeds. To the best of our knowledge, these are the first results for this general setting.

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

↑