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

环中的安全寄存器令牌传输

Safe Register Token Transfer in a Ring

Ted Herman

摘要:

令牌环是N个处理器的排列,它们轮流参与必须被控制的活动。令牌授予参与受控活动的权利。处理器与环中的邻居通信以获得和释放令牌。本文研究的通信机制是安全寄存器抽象,当读取寄存器的操作与相邻处理器对该寄存器的写操作并发时,该机制可能会任意损坏处理器读取的值。主要结果是简单的协议,准原子通信,从安全寄存器构造。准原子寄存器的行为是原子的,除了在并发读写操作的情况下可能返回一个特殊的未定义值。在限制写入和寄存器数量的某些条件下,准原子协议足以替代原子协议。本文演示了如何准原子协议可以用来实现一个自稳定的令牌环,无论是通过使用两个安全寄存器之间的相邻处理器或通过使用O(lg N)的安全寄存器之间的邻居,这降低了读复杂度。

英文摘要:

A token ring is an arrangement of N processors that take turns engaging in an activity which must be controlled. A token confers the right to engage in the controlled activity. Processors communicate with neighbors in the ring to obtain and release a token. The communication mechanism investigated in this paper is the safe register abstraction, which may arbitrarily corrupt a value that a processor reads when the operation reading a register is concurrent with an write operation on that register by a neighboring processor. The main results are simple protocols for quasi-atomic communication, constructed from safe registers. A quasi-atomic register behaves atomically except that a special undefined value may be returned in the case of concurrent read and write operations. Under certain conditions that constrain the number of writes and registers, quasi-atomic protocols are adequate substitutes for atomic protocols. The paper demonstrates how quasi-atomic protocols can be used to implement a self-stabilizing token ring, either by using two safe registers between neighboring processors or by using O(lg N) safe registers between neighbors, which lowers read complexity.

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

↑