Real-time multiprocessor locks with nesting: optimizing the common case
Real-time multiprocessor locks with nesting: optimizing the common case
复制标题
DOI：
10.1007/s11241-019-09328-w
复制
发表时间：
2017-10
影响因子：
1.3
通讯作者：
Catherine E. Nemitz;Tanya Amert;James H. Anderson
中科院分区：
文献类型：
--
作者：
Catherine E. Nemitz;Tanya Amert;James H. Anderson
在多处理器实时锁定协议的先前工作中，只有RNLP家族中的协议支持无限制的锁嵌套，同时保证渐进最优的优先级反转阻塞边界。然而，这些协议支持嵌套，但代价是增加了处理非嵌套锁请求的成本，这在实践中往往是常见的情况。为了补救这种情况，本文提出了一种新的快速路径机制，该机制通过确保有效地处理非嵌套请求来扩展先前的RNLP变体。这种机制产生的开销和阻塞成本与最有效的单资源锁定协议中的开销和阻塞成本几乎相同。在实验中，所提出的快速路径机制使观察到的非嵌套请求的阻塞时间比现有RNLP变体低17倍。
In prior work on multiprocessor real-time locking protocols, only protocols within the RNLP family support unrestricted lock nesting while guaranteeing asymptotically optimal priority-inversion blocking bounds. However, these protocols support nesting at the expense of increasing the cost of processing non-nested lock requests, which tend to be the common case in practice. To remedy this situation, anewfast-path mechanismis presented herein that extends prior RNLP variants by ensuring that non-nested requests are processed efficiently. This mechanism yields overhead and blocking costs for such requests that are nearly identical to those seen in the most efficient single-resource locking protocols. In experiments, the proposed fast-path mechanism enabled observed blocking times for non-nested requests that were up to 17 times lower than under an existing RNLP variant.