.png){kind=icon}
返回
A distributed k-mutual exclusion algorithm based on autonomic spanning trees
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2018.01.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distributed k-mutual exclusion ensures that at most a single process has permission to access each of the k copies of a critical resource. In this work we present an autonomic solution for distributed k-mutual exclusion that adapts itself after system changes. Our solution employs a hierarchical best-effort broadcast algorithm to propagate messages reliably and efficiently. The broadcast is based on another autonomic building block: a distributed algorithm for creating and maintaining spanning trees constructed in a fully distributed and adaptive way on top of a virtual hypercube-like topology, called VCube. The proposed solutions are autonomic in the sense that they reconfigure themselves automatically after the detection of faults given the set of correct processes in the system. All proposed algorithms are described, specified, and proofs of correctness are given. Results from simulation show that the proposed approach is more efficient and scalable compared to other solutions. (C) 2018 Elsevier Inc. All rights reserved.
Keyword:
Mutual exclusion
Distributed applications
Fault-tolerance
Reliable broadcast
Hypercube-like topology
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
Author response: Postural control of arm and fingers through integration of movement commands.png)
OAAI
IF0
OAAI分享收藏
分享收藏
查看更多内容