Essential Theory

Concurrent algorithms and synchronization techniques have a long and very rich history of formalization—far too much to even survey adequately here. Arguably the most accessible resource for practitioners is the text of Herlihy et al. (2021). Deeper, more mathematical coverage can be found in the text of Schneider (1997). On the broader topic of distributed computing (which as noted in the ‘Distribution’ box near the beginning of Chapter  1 is viewed by theoreticians as a superset of shared-memory concurrency), interested readers may wish to consult the classic text of Lynch (1996).