Transactional Memory Research Papers - Academia.edu (original) (raw)

Society is becoming a great source of knowledge and innovation, the synergy of all the ideas that are coming from all the countries across the world is fostering the rise of a new kind of society where knowledge plays an important role,... more

Society is becoming a great source of knowledge and innovation, the synergy of all the ideas that are coming from all the countries across the world is fostering the rise of a new kind of society where knowledge plays an important role, nevertheless today’s society needs a global strategy to improve knowledge management in order to ensure its accessibility. This paper introduces a global strategy supported on the one hand, by a methodological framework that proposes a transactive memory system to allow encoding, storing, and retrieving knowledge collectively in a smart manner, on the other hand, it is supported by a technological framework based on Web 2.0 technologies aimed to implement the methods and strategies defined in the transactive memory system. Moreover, this global strategy must ensure the maturity of the generated knowledge in order to foster innovation; also knowledge use must be tracked and measured in order to allow knowledge to become intellectual capital,whichis on...

1 ABSTRACT The article discusses the connection between two team mental models - Transactive Memory System and Shared Situation Awareness in virtual, synchronous ad-hoc mission teams. It is argued that both models are interdependent. The... more

1 ABSTRACT The article discusses the connection between two team mental models - Transactive Memory System and Shared Situation Awareness in virtual, synchronous ad-hoc mission teams. It is argued that both models are interdependent. The research conducted follows a qualitative but experimental approach utilizing the exciting game World of Warcraft as platform. Interesting communication patterns and in-depth analyses of teams playing World of Warcraft are offered.

This paper formalizes and studies combinable memory-block transactions (MBTs). The idea is to encode short programs that operate on a single cache/memory block and then to specify such a program with a memory request. The code is then... more

This paper formalizes and studies combinable memory-block transactions (MBTs). The idea is to encode short programs that operate on a single cache/memory block and then to specify such a program with a memory request. The code is then executed at the ...

Revisiting Gray and Putzolu's famous rule in the age of Flash.

There has been a growing interest in programming models for con-currency. 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... more

There has been a growing interest in programming models for con-currency. 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.

Transacted Memory offers persistence, undoability and auditing. We present a Java/JML Reference Model of the Transacted Memory system on the basis of our earlier separate Z model and C implementation. We conclude that Java/JML combines... more

Transacted Memory offers persistence, undoability and auditing. We present a Java/JML Reference Model of the Transacted Memory system on the basis of our earlier separate Z model and C implementation. We conclude that Java/JML combines the advantages of a high level specification in the JML part (based on our Z model), with a detailed implementation in the Java part (based on our C implementation).

Transactional memory systems trade ease of programming with run-time performance losses in handling transactions. This paper focuses on starvation effects that show up in systems where unordered transactions are committed on a... more

Transactional memory systems trade ease of programming with run-time performance losses in handling transactions. This paper focuses on starvation effects that show up in systems where unordered transactions are committed on a demand-driven basis. Such simple commit arbitration policies are prone to starvation. The design issues for commit arbitration policies are analyzed and novel policies that reduce the amount of wasted computation due to roll-back and, most importantly, that avoid starvation are proposed. We analyze in detail how to incorporate them in a TCC-like transactional memory protocol. The proposed schemes have no impact on the common-case performance and add quite modest complexity to the baseline protocol.