返回
Self-stabilizing byzantine asynchronous unison
DOI:10.1016/j.jpdc.2012.04.001.png)
摘要
En 中文
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under a less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present then a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies under the central strongly fair daemon. Our algorithm has minimum possible containment radius and optimal stabilization time. (C) 2012 Elsevier Inc. All rights reserved.
Keyword:
Self-stabilization
Byzantine containment
Strict stabilization
Unison
Clock synchronization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K

