基于请求的无死锁闲聊
Request-Based Gossiping without Deadlocks
摘要:
分布式平均问题是指在一个分布式网络中,只使用相邻代理之间的通信来计算代理所拥有的一组数字的平均值的问题。闲话是一个众所周知的方法来解决这个问题,它试图通过允许每个代理在每个迭代步骤中与最多一个邻居交换信息来迭代地得出一个解决方案。设计一个能够实现这一点的闲聊协议是具有挑战性的,因为闲聊是一个固有的协作过程,除非采取谨慎的预防措施来确保它不会导致死锁。许多八卦协议是基于请求的,这意味着只要两个代理中的一个接受另一个提出的八卦请求,两个代理之间就会发生八卦。在本文中,我们提出了三个确定性的基于请求的协议。我们通过例子表明,第一个可以死锁。第二个是保证避免死锁,并需要更少的传输比标准的基于广播的分布式平均协议,通过利用本地排序的想法与代理的邻居队列的概念;该协议需要最简单的队列更新,这提供了一个深入了解本地排序和队列更新如何避免死锁。结果表明,第三个协议,它使用了一个稍微复杂的队列更新规则,可以导致显着更快的收敛速度,最坏的情况下提供的收敛速度。
英文摘要:
By the distributed averaging problem is meant the problem of computing the average value of a set of numbers possessed by the agents in a distributed network using only communication between neighboring agents. Gossiping is a well-known approach to the problem which seeks to iteratively arrive at a solution by allowing each agent to interchange information with at most one neighbor at each iterative step. Crafting a gossiping protocol which accomplishes this is challenging because gossiping is an inherently collaborative process which can lead to deadlocks unless careful precautions are taken to ensure that it does not. Many gossiping protocols are request-based which means simply that a gossip between two agents will occur whenever one of the two agents accepts a request to gossip placed by the other. In this paper, we present three deterministic request-based protocols. We show by example that the first can deadlock. The second is guaranteed to avoid deadlocks and requires fewer transmissions per iteration than standard broadcast-based distributed averaging protocols by exploiting the idea of local ordering together with the notion of an agent's neighbor queue; the protocol requires the simplest queue updates, which provides an in-depth understanding of how local ordering and queue updates avoid deadlocks. It is shown that a third protocol which uses a slightly more complicated queue update rule can lead to significantly faster convergence; a worst case bound on convergence rate is provided.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。