Topic
Transactional memory
About: Transactional memory is a research topic. Over the lifetime, 2365 publications have been published within this topic receiving 60818 citations.
Papers published on a yearly basis
Papers
More filters
•
TL;DR: OptSVA is introduced, a pessimistic TM concurrency control algorithm that ensures a high level of parallelism through a battery of far-reaching optimizations including early release, asynchronous execution, and the extensive use of buffering.
Abstract: Transactional Memory (TM) is an approach aiming to simplify concurrent programming by automating synchronization while maintaining efficiency. TM usually employs the optimistic concurrency control approach, which relies on transactions aborting and restarting if conflicts occur. However, an aborted transaction can still leave some effects in the system that cannot be cleaned up, if irrevocable operations are present within its code. The pessimistic approach eliminates that problem, since it relies on deferring operations in case of conflict rather than aborting, but hitherto pessimistic TMs suffered from low parallelism due to the need of serializing transactions. In this paper, we aim to introduce OptSVA, a pessimistic TM concurrency control algorithm that ensures a high level of parallelism through a battery of far-reaching optimizations including early release, asynchronous execution, and the extensive use of buffering.
1 citations
•
TL;DR: In the premise of the correct execution of workflow, the concept of constraint is introduced for the purpose of the concurrency control of transactional workflow, and the performance and efficiency of the system has improved.
Abstract: Many business process operations are transactional workflow in LiaoHe River water environmental management systemIn the traditional workflow system,concurrency control mainly based on the realization of accessing control on the shared data,using it process the transactional workflow would affect the efficiency of the system when some business process operations sustained for a long timeIn this case,these processes hold the shared data for a long time,so other processes must waitTo solve the problem,this paper uses a similar thought of instructions pipelining in the processor to research a method of concurrency control on transactional workflow,and based on it the general design model is givenThe workflows are highly scheduled wth the help of concurrency controler and the task managerIn the premise of the correct execution of workflow,the concept of constraint is introduced for the purpose of the concurrency control of transactional workflow,thereby the performance and efficiency of the system has improved
1 citations
••
17 Feb 2021TL;DR: In this article, the authors investigate the trade-offs between ease of use and efficiency of transactional futures, i.e., futures that execute as atomic transactions and that are spawned/evaluated by other (plain) transactions.
Abstract: This paper investigates the problem of integrating two powerful abstractions for concurrent programming, namely futures and transactional memory. Our focus is on specifying the semantics of execution of "transactional futures", i.e., futures that execute as atomic transactions and that are spawned/evaluated by other (plain) transactions or transactional futures. We show that, due to the ability of futures to generate parallel computations with complex dependencies, there exist several plausible (i.e., intuitive) alternatives for defining the isolation and atomicity semantics of transactional futures. The alternative semantics we propose explore different trade-offs between ease of use and efficiency. We have implemented the proposed semantics by introducing a graph-based software transactional memory algorithm, which we integrated with a state of the art JAVA-based Software Transactional Memory (STM). We quantify the performance trade-offs associated with the different semantics using an extensive experimental study encompassing a wide range of diverse workloads.
1 citations
••
11 Sep 2016TL;DR: This work proposes a software/hardware hybrid approach, which leverages Intel's hardware transactional memory (TSX) to support implicit checkpoint creation and fast rollback, leading to a resulting performance overhead of 19% on average.
Abstract: Software-based fault-tolerance mechanisms can increase the reliability of multi-core CPUs while being cheaper and more flexible than hardware solutions like lockstep architectures. However, checkpoint creation, error detection and correction entail high performance overhead if implemented in software. We propose a software/hardware hybrid approach, which leverages Intel's hardware transactional memory (TSX) to support implicit checkpoint creation and fast rollback. Hardware enhancements are proposed and evaluated, leading to a resulting performance overhead of 19% on average.
1 citations
••
17 Sep 2006TL;DR: The paper considers two such resources, global variables and databases, and defines transactional APIs for them in Haskell, which provide a novel flavor of user-level transactions which are particularly suitable in the context of web-based systems.
Abstract: Correct handling of concurrently accessed external resources is a demanding problem in programming. The standard approaches rely on database transactions or concurrency mechanisms like locks. The paper considers two such resources, global variables and databases, and defines transactional APIs for them in Haskell. The APIs provide a novel flavor of user-level transactions which are particularly suitable in the context of web-based systems. This suitability is demonstrated by providing a second implementation in the context of WASH, a Haskell-based Web programming system. The underlying implementation framework works for both kinds of resources and can serve as a blueprint for further implementations of user-level transactions. The Haskell type system provides an encapsulation of the transactional scope that avoids unintended breakage of the transactional guarantees.
1 citations