March 13, 2007

Beautiful Concurrency

Simon Peyton-Jones and Simon Marlow’s work on software transactional memory offers a very interesting alternative to traditional lock-based or lock-free approaches to implementing concurrent programs. Their
paper “Composable Memory Transactions” is a fascinating read: it isn’t often that you see research that is simultaneously so practical and so beautiful.

I had read, and been impressed by, the STM paper a year or so ago. So I was happy to notice recently that:

  1. O’Reilly is publishing a book of essays by prominent software developers called Beautiful Code — about, well, beautiful code. That should almost certainly be worth reading:
  2. Simon PJ’s chapter in that book, “Beautiful Concurrency”, is available online, and offers a more introductory-level treatment of the ideas behind STM.

Hat tip: Tim Bray, LtU


Leave a comment

Filed under Advogato, PostgreSQL

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s