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, a new fast-path mechanism is 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 18 times lower than under an existing RNLP variant and improved schedulability over that variant and a simple group lock.

中文翻译：

---

带嵌套的实时多处理器锁：优化常见情况

在多处理器实时锁定协议的先前工作中，只有 RNLP 系列中的协议支持不受限制的锁定嵌套，同时保证渐近最优的优先级反转阻塞边界。然而，这些协议以增加处理非嵌套锁请求的成本为代价支持嵌套，这在实践中往往是常见的情况。为了纠正这种情况，本文提出了一种新的快速路径机制，通过确保有效处理非嵌套请求来扩展先前的 RNLP 变体。这种机制为此类请求产生的开销和阻塞成本几乎与最有效的单一资源锁定协议中所见的相同。在实验中，