Abstract
Software transactional memory (STM) is a new approach for coordinating concurrent threads, for which many different implementation strategies are currently being researched. In this paper we show that if a language implementation provides reflective access to explicit memory locations, it becomes straightforward to both (a) build an STM framework for this language and (b) to implement STM algorithms using this framework. A proof-of-concept implementation in the form of a Scheme interpreter (written in Common Lisp) is presented.
Original language | English |
---|---|
Pages (from-to) | 221-245 |
Number of pages | 25 |
Journal | Journal of Universal Computer Science |
Volume | 16 |
Issue number | 2 |
Publication status | Published - 28 Jan 2010 |
Bibliographical note
Antonio Menenez LeitaoKeywords
- Software Transactional Memory
- Concurrency
- Framework