Dynamic Lock-Free Double-Ended Queues Using Single-Address Double-Word Compare-and-Swap
Original Publication Date: 2003-May-28
Included in the Prior Art Database: 2003-May-28
Lock-free objects are inherently fault-tolerant and perform well even under thread failures and arbitrary delays. This invention presents a method for a lock-free implementation of dynamic double-ended queues using single-address double word compare-and-swap instruction that is available on most current processor architectures.