Restartable Nested STM Transactions

By: on November 4, 2005

I’ve just finished reading [Versioned Boxes as the Basis for Memory
Transactions](http://research.microsoft.com/~tharris/scool/papers/cachopo-scool2005.pdf),
which proposes some neat extensions to the STM model to make it more
suitable for applications with long-running transaction and high
contention. It also solves another problem of traditional STMs by
guaranteeing that transactions will always see a consistent state during
execution.

These innovations bring STMs closer to being a universal memory
model, as discussed [here](/blog/2005/09/26/transactions-everywhere). They do, of course, come at a price. There is significantly more
bookkeeping involved, and it is also not yet clear whether a efficient
lock-free implementation, like in simpler STM models, is
possible. Overall though the approach looks very promising.

FacebookTwitterGoogle+

2 Comments

  1. Shae Erisson says:

    STM discussion link is broken, though easily deciphered.

  2. matthias says:

    Thanks for pointing that out. Fixed.

Post a comment

Your email address will not be published.

*

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>