A Lock Free Doubly Linked List With Safe Memory Reclamation

SarmadAsghar

Rate me:

3.00/5 (2 votes)

3 Oct 2014CPOL5 min read

15.6K

109

This is the second lock-free implementation (first is by H°akan Sundell) that only needs the single-word compare-and-swap atomic primitive.

Views

Daily Counts

Weekly Counts

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

SarmadAsghar

Team Leader VF

Pakistan

This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.