Transactional memory

About: Transactional memory is a research topic. Over the lifetime, 2365 publications have been published within this topic receiving 60818 citations.

Beehive: A Framework for Graph Data Analytics on Cloud Computing Platforms

Abstract: Beehive is a parallel programming framework designed for cluster-based computing environments in cloud data centers. It is specifically targeted for graph data analysis problems. The Beehive framework provides the abstraction of key-value based global object storage, which is maintained in memory of the cluster nodes. Its computation model is based on optimistic concurrency control in executing concurrent tasks as atomic transactions for harnessing amorphous parallelism in graph analysis problems. We describe here the architecture and the programming abstractions provided by this framework, and present the performance of the Beehive framework for several graph problems such as maximum flow, minimum weight spanning tree, graph coloring, and the PageRank algorithm.

Practical condition synchronization for transactional memory

Abstract: Few transactional memory implementations allow for condition synchronization among transactions. The problems are many, most notably the lack of consensus about a single appropriate linguistic construct, and the lack of mechanisms that are compatible with hardware transactional memory. In this paper, we introduce a broadly useful mechanism for supporting condition synchronization among transactions. Our mechanism supports a number of linguistic constructs for coordinating transactions, and does so without introducing overhead on in-flight hardware transactions. Experiments show that our mechanisms work well, and that the diversity of linguistic constructs allows programmers to chose the technique that is best suited to a particular application.

Scheduling Conditions for Real-Time Software Transactional Memory

Abstract: Software transactional memory (STM) is a transactional mechanism of controlling access to shared resources in memory. Recently, variants of STM with real-time support have been presented. Due to its abort-restart nature, the execution semantics of STM are different from the classical preemptive or nonpreemptive model. In this letter, we formally derive utilization based necessary and sufficient scheduling condition for a STM system using lazy conflict detection.