Software Transactions: A Programming Language Perspective
Last week, UWTV published a webcast by Dan Grossman that gave an overview of the state-of-the-art for Transactional Memory: "Software Transactions: A Programming Language Perspective". Dan also gave this talk at Google and UC Berkeley.
Dan Grossman is an assistant professor at the University of Washington in the Department of Computer Science and Engineering. His research includes programming language design, implementation and theory.
The focus of his talk is to explore the impact of transactions on the semantics and implementation of a programming language, and study how scalable mutithread transactions can be:
With multicore processors bringing parallel computing to the masses, there is an urgent need to make concurrent programming easier. Software transactions hold great promise for simplifying shared-memory concurrency, and they have received enormous attention from the research community in the last couple years.
He draws an interesting analogy between Transactional Memory and Garbage Collection:
Transactional Memory (TM) is to shared-memory concurrency
Garbage Collection (GC) is to memory management
He explains that concurrent programming is hard just like memory management because you need to balance correctness and performance. He also argues that both are non-modular as the caller and callee must know about each other and often a small change can require wide-scale code change.
He suggests that the solution, just like for GC, is to move hand coded protocols to the language implementation, even though he acknowledges that Transactional Memory is an incomplete solution:
when memory conflict is a bad approximation of "cannot-be-run-in-parallel"
Dan introduces source-level formal semantics for 3 different isolation levels:
- “Strong”: If one thread is in a transaction, no other thread may use shared memory or enter a transaction
- “Weak-1-lock”: If one thread is in a transaction, no other thread may enter a transaction
- “Weak-undo”: Like weak, plus a transaction may abort at any point, undoing its changes and restarting
He suggests that there is a widespread misconception:
“Weak” isolation violates the “all-at-once” property only if corresponding lock code has a race
He then continues on to establish several key theorems, including this one:
weak-undo allows behavior weak-1-lock does not
The second part of his talk is dedicated to apply these semantics to multicore systems. He starts by pointing out that uniprocessor is an important special case. He notes:
- Threads communicating via shared memory don't execute in “true parallel”
- Many language implementations assume it
- Multicore may assign one core to an application
Dan argues that in the case of the uniprocessor, Strong isolation of Transactional Memory can be achieved at little cost. There is little memory access overhead and rollbacks are rare. In addition only the writes are logged. He also provides some example of static optimizations that can be applied at the bytecode level to enhance the performance in the non-transactional code.
Dan's team is starting to work on the multithreaded transaction case. Dan questions an important assumption that people make:
Most implementations (hw or sw) assume code inside a transaction is single-threaded, but isolation and parallelism are orthogonal (and Amdahl’s Law will strike with manycore)
He points that there are good reasons to make this assumption because it makes your implementation simpler. As the number of core increases, the performance of the system will degrade because of this assumption. If you don't make this assumption, you need to introduce nested transactions at the language level. He also points that parallelizing the logging is an important problem to solve to achieve scalability. Dan is wondering when Amdahl's law really requires these enhancements. He is suggesting that it could be when the core counts are in the hundreds.
Srini Penchikala Aug 21, 2014