Difference between revisions of "Software transactional memory"

From HaskellWiki
Jump to navigation Jump to search
(added SPJ and TH interview on Channel 9 forums)
(link Beautiful Concurrency)
Line 6: Line 6:
   
 
== Resources ==
 
== Resources ==
  +
  +
* [http://research.microsoft.com/%7Esimonpj/papers/stm/#beautiful Beautiful Concurrency] - a chapter from the book Beautiful Code
   
 
* [[Research_papers/Parallelism_and_concurrency#Lock_free_data_structures_and_transactional_memory|Research Papers on STM]]
 
* [[Research_papers/Parallelism_and_concurrency#Lock_free_data_structures_and_transactional_memory|Research Papers on STM]]

Revision as of 20:57, 23 June 2007

Introduction

Software Transactional Memory, or STM, is an abstraction for concurrent communication. The main benefits of STM are composability and modularity. That is, using STM you can write concurrent abstractions that can be easily composed with any other abstraction built using STM, without exposing the details of how your abstraction ensures safety. This is typically not the case with other forms of concurrent communication, such as locks or MVars.

STM for Haskell was first implemented in GHC 6.4. There exist STM implementations for other compilers.

Resources

Projects using STM

  • Conjure (a bittorrent client) is using STM quite heavily.
  • The HAppS MACID monad runs on top of STM. It is open source and available via darcs at http://happs.org. http://Pass.net is a production application that uses this infrastructure.
  • Shellac is a framework for building read-eval-print style shells. It uses STM, but in a pretty limited way.
  • Pugs (an implementation of Perl 6 in Haskell) uses STM, and also exposes STM to the Perl 6 programmer via a similar interface to STM Haskell.

Examples

  • Examples from this wiki: Search for "concurrent.stm" at the top of this page.