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

可靠的自稳定准同步通信

Reliable Self-Stabilizing Communication for Quasi Rendezvous

Colette Johnen, Ivan Lavallee, Christian Lavault

摘要:

本文提出了三个基本的公平和可靠的链路通信原语的自稳定协议。我们假设一个链接寄存器通信模型下的读/写原子,其中每个进程可以读取,但不能写入其邻居的寄存器。第一个原语保证任何进程只有在其所有邻居都读取了前一个值之后才在其寄存器中写入新值,无论进程的动作的初始调度如何。第二个原语通过使用交替位协议实现了“弱会合”通信机制:每当一个进程连续将n个值(可能是相同的值)写入寄存器时,每个邻居都保证从寄存器中读取每个值至少一次。在前一个协议的基础上,第三个原语实现了一个“准会合”:换句话说,这个原语进一步确保了两个写操作之间只存在一个读操作所有协议都是自稳定的,并且在异步任意网络中运行。本文的目标是通过一个单独的过程来处理每个原语,这可以在更复杂的自稳定协议中用作“黑盒”。

英文摘要:

The paper presents three self-stabilizing protocols for basic fair and reliable link communication primitives. We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The first primitive guarantees that any process writes a new value in its register(s) only after all its neighbours have read the previous value, whatever the initial scheduling of processes' actions. The second primitive implements a "weak rendezvous" communication mechanism by using an alternating bit protocol: whenever a process consecutively writes n values (possibly the same ones) in a register, each neighbour is guaranteed to read each value from the register at least once. On the basis of the previous protocol, the third primitive implements a "quasi rendezvous": in words, this primitive ensures furthermore that there exists exactly one reading between two writing operations All protocols are self-stabilizing and run in asynchronous arbitrary networks. The goal of the paper is in handling each primitive by a separate procedure, which can be used as a "black box" in more involved self-stabilizing protocols.

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

↑