scholarly journals Transactional Distributed 64-Bit Memory for PC-Clusters

2010 ◽  
Vol 1 (1) ◽  
pp. 10-18
Author(s):  
Nico Kaemmer ◽  
Steffen Gerhold ◽  
Patrick Schmidt ◽  
Michael Sonnenfroh ◽  
Stefan Frenz ◽  
...  
Keyword(s):  
Operating System ◽  
Data Structures ◽  
Garbage Collection ◽  
Transactional Memory ◽  
Distributed Objects ◽  
Application Data ◽  
Language Environment ◽  
Consistency Models

The Rainbow operating system provides 64-Bit transactional memory operation for PC-clusters. Basic consistency of the distributed objects is guaranteed by an optimistic transactions scheme and weakened consistency models are available for application data structures. The Java-like language environment allows for binary isolation, compiler-based OS security and for clusterwide garbage collection. An optional pageserver will offer orthogonal persistence as well as subsecond restart and recovery.

MetaTM/TxLinux: Transactional Memory for an Operating System

IEEE Micro ◽  
2008 ◽  
Vol 28 (1) ◽  
pp. 42-51 ◽  
Author(s):  
H.E. Ramadan ◽  
C.J. Rossbach ◽  
D.E. Porter ◽  
O.S. Hofmann ◽  
A. Bhandari ◽  
...  
Keyword(s):  
Operating System ◽  
Transactional Memory

scholarly journals ASF: AMD64 Extension for Lock-Free Data Structures and Transactional Memory

2010 ◽  
Author(s):  
Jaewoong Chung ◽  
Luke Yen ◽  
Stephan Diestelhorst ◽  
Martin Pohlack ◽  
Michael Hohmuth ◽  
...  
Keyword(s):  
Data Structures ◽  
Transactional Memory ◽  
Free Data

scholarly journals The Transactional Memory

2019 ◽  
pp. 13-20
Author(s):  
V. M. Dhivya Shri ◽  
K. Reshma
Keyword(s):  
Programming Language ◽  
Garbage Collection ◽  
Transactional Memory ◽  
Concurrent Programming ◽  
The Other

Transactional memory (TM) promises to simplify concurrent programming. Language-based constructs allow programmers to denote atomic regions declaratively. Its implementations operate by tracking loads and stores to memory and by detecting concurrent conflicts. TM allows programmers to write simpler programs that are composable and deadlock-freeThis essay presents remarkable similarities between transactional Memory and garbage collection. The connections are fascinating in their own right, and they let us better stand one technology by thinking about the corresponding issues for the other.

scholarly journals PETRA

2021 ◽  
Vol 18 (2) ◽  
pp. 1-26
Author(s):  
Ramin Izadpanah ◽  
Christina Peterson ◽  
Yan Solihin ◽  
Damian Dechev
Keyword(s):  
Data Structures ◽  
High Performance ◽  
Transactional Memory ◽  
Superior Performance ◽  
New Approach ◽  
Ordering Constraints ◽  
Level Information ◽  
Order Of Magnitude ◽  
Persistent Data ◽  
High Level

Emerging byte-addressable Non-Volatile Memories (NVMs) enable persistent memory where process state can be recovered after crashes. To enable applications to rely on persistent data, durable data structures with failure-atomic operations have been proposed. However, they lack the ability to allow users to execute a sequence of operations as transactions. Meanwhile, persistent transactional memory (PTM) has been proposed by adding durability to Software Transactional Memory (STM). However, PTM suffers from high performance overheads and low scalability due to false aborts, logging, and ordering constraints on persistence. In this article, we propose PETRA, a new approach for constructing persistent transactional linked data structures. PETRA natively supports transactions, but unlike PTM, relies on the high-level information from the data structure semantics. This gives PETRA unique advantages in the form of high performance and high scalability. Our experimental results using various benchmarks demonstrate the scalability of PETRA in all workloads and transaction sizes. PETRA outperforms the state-of-the-art PTMs by an order of magnitude in transactions of size greater than one, and demonstrates superior performance in transactions of size one.

Sign in / Sign up

Export Citation Format

Share Document