DiSTM: A Software Transactional Memory Framework for Clusters

Kotselidis, Christos; Ansari, Mohammad; Jarvis, Kim; Luján, Mikel; Kirkham, Chris; Watson, Ian

doi:10.1109/icpp.2008.59

Cited by 74 publications

(63 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, our work is clearly related to the recent literature on distributed STMs [4,6,15,16]. However, except [6], none of these solutions leverages on replication in order to enhance system dependability.…”

Section: Related Workmentioning

confidence: 63%

AGGRO: Boosting STM Replication via Aggressively Optimistic Transaction Processing

Palmieri

Quaglia

Romano

2010

2010 Ninth IEEE International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 63%

AGGRO: Boosting STM Replication via Aggressively Optimistic Transaction Processing

Palmieri

Quaglia

Romano

2010

2010 Ninth IEEE International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

show abstract

“…They were dedicated to shared memory systems, all relying on an underlying hardware cachecoherence [35,36]. More recently, much effort was spent in implementing the TM abstraction on top of clusters of distributed machines, resulting in various distributed transactional memories (DTMs) [5,25,27,33].This distribution unveiled new research challenges, whose prominent one is possibly to guarantee transaction termination despite messagebased synchronization. Our solution is the first to exploit many-cores to provide efficient transactions that are guaranteed to terminate.…”

Section: Related Workmentioning

confidence: 99%

“…The second mode relies on a centralized master node, which may hamper the scalability by serializing all update transactions, even non-conflicting ones. DiSTM [25] is a framework for prototyping and testing software cache-coherence protocols for TMs. The underlying TCC protocol is described as a decentralized coherence protocol, yet it needs a single master node and a global ticket mechanism.…”

Section: Related Workmentioning

confidence: 99%

TM ² C

Gramoli

Guerraoui

Trigonakis

2012

Proceedings of the 7th ACM European Conference on Computer Systems

View full text Add to dashboard Cite

Transactional memory is an appealing paradigm for concurrent programming. Many software implementations of the paradigm were proposed in the last decades for both shared memory multi-core systems and clusters of distributed machines. However, chip manufacturers have started producing many-core architectures, with low network-on-chip communication latency and limited support for cache-coherence, rendering existing transactional memory implementations inapplicable.This paper presents TM 2 C, the first software Transactional Memory protocol for Many-Core systems. TM 2 C exploits network-on-chip communications to get granted accesses to shared data through efficient message passing. In particular, it allows visible read accesses and hence effective distributed contention management with eager conflict detection.We also propose FairCM, a companion contention manager that ensures starvation-freedom, which we believe is an important property in many-core systems, as well as an implementation of elastic transactions in these settings. Our evaluation on four benchmarks, i.e., a linked list and a hash table data structures as well as a bank and a MapReduce-like applications, indicates better scalability than locks and up to 20-fold speedup (relative to bare sequential code) when running 24 application cores.

show abstract

“…The vast majority either does not consider fault-tolerance [27], [28], or are fully replicated [29], [30], [31].…”

Section: Related Workmentioning

confidence: 99%

Exploiting Total Order Multicast in Weakly Consistent Transactional Caches

Ruivo

Couceiro

Romano

et al. 2011

2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing

View full text Add to dashboard Cite

Abstract-Nowadays, distributed in-memory caches are increasingly used as a way to improve the performance of applications that require frequent access to large amounts of data. In order to maximize performance and scalability, these platforms typically rely on weakly consistent partial replication mechanisms. These schemes partition the data across the nodes and ensure a predefined (and typically very small) replication degree, thus maximizing the global memory capacity of the platform and ensuring that the cost to ensure replica consistency remains constant as the scale of the platform grows. Moreover, even though several of these platforms provide transactional support, they typically sacrifice consistency, ensuring guarantees that are weaker than classic 1-copy serializability, but that allow for more efficient implementations.This paper proposes and evaluates two partial replication techniques, providing different (weak) consistency guarantees, but having in common the reliance on total order multicast primitives to serialize transactions without incurring in distributed deadlocks, a main source of inefficiency of classical two-phase commit (2PC) based replication mechanisms.We integrate the proposed replication schemes into Infinispan, a prominent open-source distributed in-memory cache, which represents the reference clustering solution for the well-known JBoss AS platform. Our performance evaluation highlights speed-ups of up to 40x when using the proposed algorithms with respect to the native Infinispan replication mechanism, which relies on classic 2PC-based replication.

show abstract

DiSTM: A Software Transactional Memory Framework for Clusters

Cited by 74 publications

References 19 publications

AGGRO: Boosting STM Replication via Aggressively Optimistic Transaction Processing

AGGRO: Boosting STM Replication via Aggressively Optimistic Transaction Processing

TM ² C

Exploiting Total Order Multicast in Weakly Consistent Transactional Caches

Contact Info

Product

Resources

About