[0016] The proposed implementation is obstruction-free, meaning that if a thread t executes a transaction (or NCAS) and, at some point, t runs without interruption for long enough, then that transaction (or NCAS) will complete. The load operation is wait-free: it will return a value as...
Node 1 again asserts its BREQ0 line, meaning that node 3 again sees BREQ14. Node 3 again asserts its BREQ0 line, meaning that node 1 again sees BREQ2. In node 1, none of the 16 equations above is satisfied at this time. Attention is called to equation (15), which looks likely...