Abstract
SPSC unbounded linked list are very easy to construct and may have interesting properties like Wait-freedom or Lock Freedom but generally provided implementation are unbounded and require Memory Allocation for adding nodes. The purpose of this document is to present an idea giving the possibility to keep all the interesting properties of the Linked List but to transform it into and Bounded Linked List without memory allocation.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Recommended Citation
Afriat, Frank, "Generic Mechanism for Transforming a Single-Producer / Single-Consumer Unbounded Linked List into a Bounded Linked List without Allocation", Technical Disclosure Commons, (October 20, 2016)
https://www.tdcommons.org/dpubs_series/304