Concurrency for the Masses: The Paradigm of Software Transactional Memory

摘要

This paper reviews the basics of Software Transactional Memory (STM) algorithms, examines some of their properties, and briefly discusses a collection of impossibility and possibility results in STM computing. The material presented in this paper summarizes the main points of the talk that the author delivered in the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2017) as an invited speaker through the ACM Distinguished Speakers Programme.