Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Transactional memory

Known as: Hardware transactional memory 
In computer science and engineering, transactional memory attempts to simplify concurrent programming by allowing a group of load and store… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Transactional memory (TM) is an appealing paradigm for concurrent programming on shared memory architectures. With a TM, threads… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We report on our experience with the hardware transactional memory (HTM) feature of two pre-production revisions of a new… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Transactional memory is a promising approach to ease parallel programming. Hardware transactional memory system designs reflect… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Transactional memory (TM) is perceived as an appealing alternative to critical sections for general purpose concurrent… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Transactional memory (TM) simplifies parallel programming by guaranteeing that transactions appear to execute atomically and in… Expand
  • table 5-1
  • table 5-2
  • table 5-3
  • figure 5-1
  • figure 5-3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Transactional memory (TM) promises to substantially reduce the difficulty of writing correct, efficient, and scalable concurrent… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Transactional memory has great potential for simplifying multithreaded programming by allowing programmers to specify regions of… Expand
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, we propose a new shared memory model: transactional memory coherence and consistency (TCC). TCC provides a model… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the… Expand
  • table 3
  • table 1
  • table 2
  • figure 4
  • figure 5
Is this relevant?