多核架构上seL4高效锁的实用Rely/Guarantee验证
Practical Rely/Guarantee Verification of an Efficient Lock for seL4 on Multicore Architectures
AI总结:
本文针对多核架构弱内存模型导致的乱序执行与微并行性问题,利用Jones的rely/guarantee推理方法对seL4微内核中的锁算法进行了深入验证,同时处理了线程间通信与线程内微并行性。
摘要:
为操作系统和内核提供核心功能的底层系统代码开发者必须应对现代多核架构的硬件级特性。一个特定特性是按编写顺序的代码被流水线化“乱序执行”,其影响通常被概括为“弱内存模型”——该术语还包括编译器优化可能引入的进一步复杂因素。在许多情况下,弱内存模型固有的非确定性可以表示为微并行性,即线程内部的并行性,而不仅仅是线程之间的并行性。幸运的是,Jones的rely/guarantee推理为共享变量并发提供了一种组合方法,无论是在顶层线程之间的通信还是线程内的微并行性方面。在本文中,我们对seL4微内核中使用的锁算法进行了深入验证,使用rely/guarantee来处理线程间通信以及弱内存模型引入的微并行性。
英文摘要:
Developers of low-level systems code providing core functionality for operating systems and kernels must address hardware-level features of modern multicore architectures. A particular feature is pipelined "out-of-order execution" of the code as written, the effects of which are typically summarised as a "weak memory model" - a term which includes further complicating factors that may be introduced by compiler optimisations. In many cases, the nondeterminism inherent in weak memory models can be expressed as micro-parallelism, i.e., parallelism within threads and not just between them. Fortunately Jones' rely/guarantee reasoning provides a compositional method for shared-variable concurrency, whether that be in terms of communication between top-level threads or micro-parallelism within threads. In this paper we provide an in-depth verification of the lock algorithm used in the seL4 microkernel, using rely/guarantee to handle both interthread communication as well as micro-parallelism introduced by weak memory models.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。