Loading...
Please wait, while we are loading the content...
Similar Documents
A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue
| Content Provider | Paperity |
|---|---|
| Author | Nikolaev, Ruslan |
| Abstract | We present a new lock-free multiple-producer and multiple-consumer (MPMC) FIFO queue design which is scalable and, unlike existing high-performant queues, very memory efficient. Moreover, the design is ABA safe and does not require any external memory allocators or safe memory reclamation techniques, typically needed by other scalable designs. In fact, this queue itself can be leveraged for object allocation and reclamation, as in data pools. We use FAA (fetch-and-add), a specialized and more scalable than CAS (compare-and-set) instruction, on the most contended hot spots of the algorithm. However, unlike prior attempts with FAA, our queue is both lock-free and linearizable. |
| Starting Page | 28:1 |
| Ending Page | 28:16 |
| File Format | HTM / HTML |
| DOI | 10.4230/LIPIcs.DISC.2019.28 |
| Journal | Leibniz International Proceedings in Informatics |
| Volume Number | 146 |
| Language | English |
| Publisher | Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik |
| Publisher Date | 2019-10-11 |
| Access Restriction | Open |
| Subject Keyword | Lock-free Ring buffer Fifo Queue Non-blocking |
| Content Type | Text |
| Resource Type | Article |
