But the algorithm does not have that nasty inconsistency window
between XCHG and store when the queue links are broken. The novel part
is that it uses another XCHG to restore the next link and figure out
if it managed to do so before anybody observed the broken link or not.
This is more expensive than 1 CAS to enqueue for uncontended case, but
I guess should sustain high contention much better.
Chris M. Thomasson
Dec 2, 2018, 5:28:05 PM12/2/18
Reply to author
Sign in to reply to author
Sign in to forward
You do not have permission to delete messages in this group
Report message as abuse
Sign in to report message as abuse
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message