.png){kind=icon}
返回
Sharing Memory between Byzantine Processes Using Policy-Enforced Tuple Spaces
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2008.96.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recent algorithms for the coordination of processes subject to Byzantine failures using shared memory have appeared. This paper presents a new computing model in which shared memory objects are protected by fine-grained access policies, and a new shared memory object, the Policy-Enforced Augmented Tuple Space (PEATS). We show the benefits of this model by providing simple and efficient consensus algorithms. These algorithms are much simpler and require less shared memory operations, using also less memory bits than previous algorithms based on access control lists (ACLs) and sticky bits. We also prove that PEATS objects are universal, i.e., that they can be used to implement any other shared memory object, and present lock-free and wait-free universal constructions.
Keyword:
Byzantine fault-tolerance
shared memory algorithms
tuple spaces
consensus
universal constructions
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
分享收藏分享收藏On the pros and cons of using temporal derivatives to assess brain functional connectivity.png)
NeuroImageOAAI
NeuroImageIF0
OAAI分享收藏
查看更多内容