Almost non-blocking linked stack implementation

摘要: A method and computer system for implementing, in a multithreaded environment, an almost non-blocking linked list allow lock-free access provided that certain conditions are met. The approach involves: associating pointer auxiliary data structure with each list, using compare-and-swap (CAS) operation, making slight modification of values associated nodes under conditions. CAS operation guards against setting the pointers incorrectly during insertion removal operations. structure, also referred to as ‘black list,’ holds dynamic values, typically process being removed by thread.