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
•
01 Jan 2003
TL;DR: Transactional Memory by Vinson Lee B.S. is presented, in partial fulfillment of the requirements for the degree of Master of Science in Electrical Engineering and Computer Science at the Massachusetts Institute of Technology June 2003.
Abstract: Transactional Memory by Vinson Lee B.S. Electrical Engineering and Computer Science University of California at Berkeley, 2000 Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Master of Science in Electrical Engineering and Computer Science at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY June 2003 @ Massachusetts Institute of Technology 2003. All rights reserved.
01 Jan 2020
••
17 Jun 2019TL;DR: In this paper, the authors show that fundamental properties of the data regions accessed by a persistent software transaction allow for a variety of optimizations not available in the volatile setting, and these lead to significant performance gains.
Abstract: There is a mechanical transformation by which algorithms for software transactional memory can be transformed to work with persistent memory. While correct, this transformation does not take into account differences between the persistent and volatile programming models. We show that fundamental properties of the data regions accessed by a persistent software transaction allow for a variety of optimizations not available in the volatile setting, and these lead to significant performance gains.
••
TL;DR: The proposed optimization eliminates the need for the prediction of conflicting accesses and introduces incremental context saving and analytical models for estimating the execution time of transactions, with and without the restart optimization, that are developed using the continuous-time model.
Abstract: This paper presents an optimization algorithm for transactional memory with lazy conflict detection. The proposed optimization attempts to minimize the execution time of restarted transactions. Minimizing happens during restart, by avoiding the re-execution of a section of a transaction that is unaffected by the restart. The proposed optimization builds on previous research and differs in that it eliminates the need for the prediction of conflicting accesses and introduces incremental context saving. Moreover, the paper introduces analytical models for estimating the execution time of transactions, with and without the restart optimization, that are developed using the continuous-time model. A critical evaluation comparing analytical models with the simulation results is discussed in the paper.
••
01 Nov 2010TL;DR: A synchronization approach which combines the notions of right backward commutativity (RBC) and forward commUTativity (FC) and determines the conflict relations dynamically by using the context-specific information and can permit more concurrency.
Abstract: Software Transactional Memory (STM) has been a popular paradigm for concurrent computing in modern multi-core architectures. To boost concurrency, recent STM systems have exploited semantics based synchronization approaches. However, only the general notion of commutativity (GC) has been used to derive conflict relations. In this paper, we develop a synchronization approach which combines the notions of right backward commutativity (RBC) and forward commutativity (FC) and determines the conflict relations dynamically by using the context-specific information. The proposed approach can permit more concurrency as the histories accepted by our approach is a strict superset of the union of that accepted by the approaches based on GC, RBC and FC.