Tag: lock-free

Maurice Herlihy and J. Eliot Moss proposed transactional memory in 1993 as an architectural way to group multiple shared-memory operations into an atomic transaction without conventional locks.

Compare-and-swap gave processors an atomic conditional update primitive powerful enough to build lock-free algorithms and, in theory, solve consensus for any number of threads.