Safra终止检测算法的容错版本
A Fault-Tolerant Version of Safra's Termination Detection Algorithm
AI总结:
本文提出一种改进的Safra终止检测算法,通过拆分计数器和本地恢复令牌环,实现对节点崩溃的容错处理,不增加消息开销,支持任意数量的崩溃检测。
摘要:
Safra的分布式终止检测算法在分布式网络中采用逻辑令牌环结构;只有被动节点转发令牌,令牌中的计数器记录已发送消息数减去已接收消息数。我们将其经典算法进行改进,使其具备容错能力。计数器被拆分为每个节点的计数器,以丢弃崩溃节点的计数。如果一个节点崩溃,令牌环会本地恢复,同时发送一个备份令牌。节点通过令牌相互告知检测到的崩溃。我们的算法不增加额外的消息开销,能够容忍任意数量的崩溃以及同时发生的崩溃,并以去中心化的方式应对崩溃。提供了原始Safra算法及其容错变体的正确性证明,以及模型检查分析。
英文摘要:
Safra's distributed termination detection algorithm employs a logical token ring structure within a distributed network; only passive nodes forward the token, and a counter in the token keeps track of the number of sent minus the number of received messages. We adapt this classic algorithm to make it fault-tolerant. The counter is split into counters per node, to discard counts from crashed nodes. If a node crashes, the token ring is restored locally and a backup token is sent. Nodes inform each other of detected crashes via the token. Our algorithm imposes no additional message overhead, tolerates any number of crashes as well as simultaneous crashes, and copes with crashes in a decentralized fashion. Correctness proofs are provided of both the original Safra's algorithm and its fault-tolerant variant, as well as a model checking analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。