.png){kind=icon}
返回
Solving the group priority inversion problem in a timed asynchronous system
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2002.1024738.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the priority inversion problem in an actively replicated system, Priority inversion was originally defined in the context of nonreplicated systems. Therefore, we first introduce the concept of group priority inversion, which extends the concept of (local) priority inversion to the context of a group of processors that perform an actively replicated processing. We then present the properties of a request scheduling protocol to enforce a total ordering for the processing of requests while avoiding group priority inversions, These properties have been implemented in a protocol that relies on a timed asynchronous system model equipped with a failure detector of the class,S. The proposed solution allows us to replicate a critical server while ensuring that the processing of all the incoming requests is consistent (mechanisms for solving the atomic broadcast problem) and predictable (mechanisms for solving the group priority inversion problem), Thus, the described request scheduling protocol is a key component which can be used to develop fault-tolerant real-time applications in a timed asynchronous system.
Keyword:
priority inversion
replicated servers
timed asynchronous model
agreement
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
New techniques for imaging, digitization and analysis of three-dimensional neural morphology on multiple scales.png)
Neuroscience
NeuroscienceIF0
PREAI
分享收藏分享收藏N-Heterocyclic Carbene and Chiral Brønsted Acid Cooperative
Catalysis for a Highly Enantioselective [4+2] AnnulationSynthesis
OAAI
SynthesisIF0
OAAI分享收藏分享收藏
查看更多内容