Practical Multiwriter Lock-Free Queues for "Hard Real-Time" Systems without CAS
| dc.creator | Lee, Jeremy | |
| dc.date | 2007-09-28 | |
| dc.date.accessioned | 2026-07-07T08:32:52Z | |
| dc.date.available | 2026-07-07T08:32:52Z | |
| dc.description | 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. | |
| dc.description | 9 Pages, Preprint | |
| dc.identifier | https://arxiv.org/abs/0709.4558 | |
| dc.identifier | http://arxiv.org/abs/0709.4558 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/138932 | |
| dc.subject | Operating Systems | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | E.1 | |
| dc.title | Practical Multiwriter Lock-Free Queues for "Hard Real-Time" Systems without CAS | |
| dc.type | text |