无CAS的“硬实时的“系统的实用多写器无锁同步
Practical Multiwriter Lock-Free Queues for "Hard Real-Time" Systems without CAS
摘要：
具有单个读取器和写入器的FIFO队列可能不足以用于“硬实时的【形】”系统，在该系统中，中断处理程序在写入消息队列时需要无等待保证。我们提出了一种算法，优雅，实用地解决了这个问题的小处理器，经常发现在嵌入式系统。该算法不需要特殊的CPU指令（如原子CAS），因此比许多现有的方法，遭受与摆动指针相关的ABA问题更强大。该算法给出了“先进，几乎先出”的病理中断条件下的保证，这表现为任意“推”之间的几乎同时到达队列的末尾。
英文摘要：
FIFO queues with a single reader and writer can be insufficient for "hard real-time" systems where interrupt handlers require wait-free guarantees when writing to message queues. We present an algorithm which elegantly and practically solves this problem on small processors that are often found in embedded systems. The algorithm does not require special CPU instructions (such as atomic CAS), and therefore is more robust than many existing methods that suffer the ABA problem associated with swing pointers. The algorithm gives "first-in, almost first-out" guarantees under pathological interrupt conditions, which manifests as arbitrary "shoving" among nearly-simultaneous arrivals at the end of the queue.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
