Dillon Niederhut
Enthought

Abstract

There has been a growing interest in programming models for concurrency. Strategies for dealing with shared data amongst parallel threads of execution include immutable (as in Erlang) and locked (as in Python) data structures. A third option exists, called transactional memory (as in Haskell), which includes thread-local journaling for operations on objects which are both mutable and globally shared. Here, we present TraM, a pure Python implementation of the TL2 algorithm for software transactional memory.

Keywords

concurrency, threading, transactional memory

DOI

10.25080/shinma-7f4c6e7-002

Bibtex entry

Full text PDF

Copyright © 2017 Dillon Niederhut. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.