scispace - formally typeset
Search or ask a question
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
More filters
Patent
28 Feb 2013
TL;DR: In this article, a method for recording and profiling information of aborted transactions from a plurality of transactions is presented, where the processor core retrieves instruction and data address associated with the aborted transaction from TFIAR and TFDAR respectively and stores them into a profiling table.
Abstract: A method for recording and profiling information of a plurality of aborted transactions from a plurality of transactions is executed by processor core with a transactional memory, a transaction failure instruction address register (TFIAR), and a transaction failure data address register (TFDAR). The transactional memory stores information of a plurality of transactions executed by the processor core. The processor core retrieves instruction and data address associated with the aborted transaction from TFIAR and TFDAR respectively and stores them into a profiling table. The processor core then generates profiling information based on instruction and data addresses associated with the aborted transaction.
Book ChapterDOI
03 Jun 2020
TL;DR: Local progress is a liveness condition which ensures that a process successfully completes every transaction it initiates, if it continually re-invokes it each time it aborts as discussed by the authors. But this method can lead to high space-related overheads in the TM implementation.
Abstract: A key goal in the design of Transactional Memory (TM) systems is ensuring liveness. Local progress is a liveness condition which ensures that a process successfully completes every transaction it initiates, if it continually re-invokes it each time it aborts. In order to facilitate this, several state-of-the-art TM systems keep multiple versions of data items. However, this method can lead to high space-related overheads in the TM implementation. Therefore, it is desirable to strike a balance between the progress that a TM can provide and its practicality, while ensuring correctness. A consistency property that limits the number of previous versions a TM may rely on, is k-staleness. It is a condition derivative of snapshot isolation, in which a transaction is not allowed to access more than k previous versions of a data item. This facilitates implementations that can take advantage of multi-versioning, while at the same time, contributing to the restriction of the space overhead introduced by the TM.
Proceedings ArticleDOI
01 Jul 2017
TL;DR: This work proposes a new approach to meet increasing scale and the need for quick response to heterogeneity by parallelism, shared resource state, and transactional memory mechanism, which is a lock-free optimistic concurrency control.
Abstract: Increasing scale and the need for quick response to heterogeneity is hard to meet with current monolithic manycore scheduler architectures. This limits the rate at which new features can be made effective use of, decreasing efficiency and utilization, and eventually restricting manycore systems’ growth. We propose a new approach to meet these needs by parallelism, shared resource state, and transactional memory mechanism, which is a lock-free optimistic concurrency control.We compare this approach to existing manycore scheduler designs, assess how much interference occurs between schedulers and how much it matters in practice, suggest some techniques to alleviate it, and finally discuss the case highlighting our lock-free approach – all driven by current popular I/O intensive and CPU intensive workloads.
Patent
18 Apr 2019
TL;DR: In this article, a lock variable is checked and commitment of results of speculatively executed instructions of the transaction is prevented or deferred when the lock variable indicates that another thread holds the exclusive access to the target resource.
Abstract: In an apparatus (2) with transactional memory support, a predetermined type of transaction start instruction or a subsequent instruction following the predetermined type of transaction start instruction triggers capture of a lock identifier which identifies a lock variable for controlling exclusive access to at least one resource. In response to a predetermined type of transaction end instruction which follows the predetermined type of transaction start instruction, the lock variable is checked and commitment of results of speculatively executed instructions of the transaction is prevented or deferred when the lock variable indicates that another thread holds the exclusive access to the target resource. This approach can improve performance when executing transactions in a transactional memory based system.
Book
01 Jan 2009
TL;DR: The Myths of Object-Orientation are presented, including type-Based Object Immutability with Flexible Initialization, and the importance of knowing how to integrate type systems into Java programs.
Abstract: Keynote 1.- Classes, Jim, But Not as We Know Them - Type Classes in Haskell: What, Why, and Whither.- Types, Frameworks and Modelling.- Coinductive Type Systems for Object-Oriented Languages.- Checking Framework Interactions with Relationships.- COPE - Automating Coupled Evolution of Metamodels and Models.- Aliasing and Transactions.- Making Sense of Large Heaps.- Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis.- NePaLTM: Design and Implementation of Nested Parallelism for Transactional Memory Systems.- Access Control and Verification.- Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logic.- Fine-Grained Access Control with Object-Sensitive Roles.- Practical API Protocol Checking with Access Permissions.- Modularity.- Adding State and Visibility Control to Traits Using Lexical Nesting.- Featherweight Jigsaw: A Minimal Core Calculus for Modular Composition of Classes.- Modular Visitor Components.- Mining and Extracting.- Debugging Method Names.- MAPO: Mining and Recommending API Usage Patterns.- Supporting Framework Use via Automatically Extracted Concept-Implementation Templates.- Refactoring.- Stepping Stones over the Refactoring Rubicon.- Program Metamorphosis.- From Public to Private to Absent: Refactoring Java Programs under Constrained Accessibility.- Keynote 2.- Java on 1000 Cores: Tales of Hardware/Software Co-design.- Concurrency, Exceptions and Initialization.- Loci: Simple Thread-Locality for Java.- Failboxes: Provably Safe Exception Handling.- Are We Ready for a Safer Construction Environment?.- Type-Based Object Immutability with Flexible Initialization.- Concurrency and Distribution.- Security Monitor Inlining for Multithreaded Java.- EventJava: An Extension of Java for Event Correlation.- Remote Batch Invocation for Compositional Object Services.- ECOOP 2008 Banquet Speech.- to: The Myths of Object-Orientation.- The Myths of Object-Orientation.

Network Information
Related Topics (5)
Compiler
26.3K papers, 578.5K citations
87% related
Cache
59.1K papers, 976.6K citations
86% related
Parallel algorithm
23.6K papers, 452.6K citations
84% related
Model checking
16.9K papers, 451.6K citations
84% related
Programming paradigm
18.7K papers, 467.9K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202316
202240
202129
202063
201970
201888