Transactional Memory: Composability & Basic Algorithms

Опубликовано 12 августа 2016, 1:11

Writing concurrent programs is notoriously difficult, and is of increasing practical importance. In this series of lectures I will introduce ΓÇ£transactional memoryΓÇ¥ (TM) as a technique for building shared memory data structures. As I will illustrate, it can be much easier to build shared memory data structures using TM than it is to use conventional abstractions such as locks, or the atomic compare-and-swap instruction. In this lecture I will introduce TM and some of the language constructs that we have built using it. I will describe the basic ΓÇ£Bartok-STMΓÇ¥ algorithm to illustrate how TM can be built on conventional computer hardware.