Results 1 - 10 of 170

Context-oriented software transactional memory in common lisp

by Pascal Costanza, Charlotte Herzeel - In Proceedings of the 5th symposium on Dynamic languages , 2009
"... Software transactional memory (STM) is a promising approach for coordinating concurrent threads, for which many implementation strategies are currently being researched. Although some first steps exist to ease experimenting with different strategies, this still re-mains a relatively complex and cumb ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
and cumbersome task. The reason is that software transactions require STM-specific dynamic crosscutting adaptations, but this is not accounted for in current STM imple-mentations. This paper presents CSTM, an STM framework based on Context-oriented Prorgamming, in which transactions are mod-elled as dynamically

Context-oriented programming in ContextL: State of the art. In LISP50: Celebrating the 50th Anniversary of Lisp (pp. 1–5

by Pascal Costanza - Lero Int. Science Centre, University of Limerick , 2008
"... There is a wide range of scenarios where software systems have to be able to behave differently according to their context of use. In Context-oriented Programming (COP), programs can be partitioned into behavioral variations that can be freely activated and combined at runtime with well-defined scop ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
-defined scopes, such that the program behavior is affected depending on context. About four years ago, we have intro-duced our vision of Context-oriented Programming and have presented the programming language ContextL as an exten-sion to the Common Lisp Object System (CLOS), as our first language extension

Lowering the overhead of nonblocking software transactional memory

by Virendra J. Marathe, Michael F. Spear, Christopher Heriot, Athul Acharya, David Eisenstat, William N. Scherer III, Michael L. Scott - DEPT. OF COMPUTER SCIENCE, UNIV. OF ROCHESTER , 2006
"... Recent years have seen the development of several different systems for software transactional memory (STM). Most either employ locks in the underlying implementation or depend on thread-safe general-purpose garbage collection to collect stale data and metadata. We consider the design of low-overhea ..."
Abstract - Cited by 73 (12 self) - Add to MetaCart
-overhead, obstruction-free software transactional memory for non-garbage-collected languages. Our design eliminates dynamic allocation of transactional metadata and co-locates data that are separate in other systems, thereby reducing the expected number of cache misses on the common-case code path, while preserving

An Extensible Interpreter Framework for Software Transactional Memory

by Charlotte Herzeel, Pascal Costanza
"... 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 ..."
Abstract - Add to MetaCart
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

Software Transactional Memory In Mercury

by Leon Mika, Supervisor Zoltan Somogyi , 2007
"... Concurrent programming is now becoming more important than ever. But for concurrent programs to work deterministically, sections of the code must be synchronised. The most common method of synchronising code is to protect the code with locks. However, code which uses locks is difficult to write and ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
and even more difficult to debug. Locking also makes it difficult to compose large programs from smaller ones. A relatively new method of synchronisation, known as Software Transactional Memory, is promising to be a much easier method of synchronisation. This thesis describes the design and implementation

D’Hondt T: Reusable Building Blocks for Software Transactional Memory

by Charlotte Herzeel, Pascal Costanza - Proceedings of the 2nd European Lisp Symposium , 2009
"... Abstract: Software transactional memory (STM) is a promising 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 location ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract: Software transactional memory (STM) is a promising 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

Efficient Nonblocking Software Transactional Memory

by Virendra J. Marathe, Mark Moir
"... The current state of the art seems to favour blocking software transactional memory (STM) implementations over nonblocking ones, and a common belief is that nonblocking STMs fundamentally cannot be made to perform as well as blocking ones. But this belief is based on experience, intuition, and anecd ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
The current state of the art seems to favour blocking software transactional memory (STM) implementations over nonblocking ones, and a common belief is that nonblocking STMs fundamentally cannot be made to perform as well as blocking ones. But this belief is based on experience, intuition

Reducing Memory Ordering Overheads in Software Transactional Memory

by Michael F. Spear, Maged M. Michael, Michael L. Scott, Peng Wu
"... Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total Store Ordering (TSO). To execute these algorithms correctly on processors with relaxed memory models, explicit fence instruct ..."
Abstract - Cited by 13 (10 self) - Add to MetaCart
Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total Store Ordering (TSO). To execute these algorithms correctly on processors with relaxed memory models, explicit fence

Inevitability Mechanisms for Software Transactional Memory

by unknown authors
"... Transactional Memory simplifies parallel programming by eliminating the use of locks to protect concurrent accesses to shared memory. However, when locks are used to provide mutual exclusion for irreversible operations (I/O, syscalls, calls to “black box” libraries), their replacement with transacti ..."
Abstract - Add to MetaCart
in an “inevitable” mode, where it is guaranteed to commit, is widely accepted as a solution to the irreversibility problem for transactions, albeit one that is not expected to scale. In this paper we explore a variety of mechanisms to support inevitability in software transactional memory. We demonstrate

Implementing and exploiting inevitability in software transactional memory

by Michael F. Spear, Michael Silverman, Luke Daless, Maged M. Michael, Michael L. Scott - In ICPP ’08: Proc. 37th IEEE international conference on parallel processing , 2008
"... Abstract—Transactional Memory (TM) takes responsibility for concurrent, atomic execution of labeled regions of code, freeing the programmer from the need to manage locks. Typical implementations rely on speculation and rollback, but this creates problems for irreversible operations like interactive ..."
Abstract - Cited by 19 (5 self) - Add to MetaCart
Abstract—Transactional Memory (TM) takes responsibility for concurrent, atomic execution of labeled regions of code, freeing the programmer from the need to manage locks. Typical implementations rely on speculation and rollback, but this creates problems for irreversible operations like interactive
Results 1 - 10 of 170