• Publications
  • Influence
Transactional Locking II
TLDR
This paper introduces the transactional locking II (TL2) algorithm, a software transactional memory (STM) algorithm based on a combination of commit-time locking and a novel version-clock based validation technique. Expand
  • 1,017
  • 215
  • PDF
Software transactional memory
TLDR
We offer software transactional memory (STM), a novel software method for supporting flexible transactional programming of synchronization operations. Expand
  • 1,061
  • 111
The art of multiprocessor programming
TLDR
Transactional memory is a computational model in which threads synchronize by optimistic, lock-free transactions, and there is a growing community of researchers working on both software and hardware support for this approach. Expand
  • 810
  • 103
  • PDF
The topological structure of asynchronous computability
TLDR
We give necessary and sufficient combinatorial conditions characterizing the tasks that can be solved by asynchronous processes, of which all but one can fail, that communicate by reading and writing a shared memory. Expand
  • 468
  • 74
  • PDF
Software transactional memory
TLDR
We offer software transactional memory (STM), a novel software method for supporting flexible transactional programming of synchronization operations. Expand
  • 664
  • 49
  • PDF
Flat combining and the synchronization-parallelism tradeoff
TLDR
We introduce a new synchronization paradigm based on coarse locking, which we call flat combining. Expand
  • 285
  • 40
  • PDF
Atomic snapshots of shared memory
TLDR
This paper introduces a general formulation of atonuc wzap~hot rnenzory, a shared memory partitioned into words written (apduted) by individual processes, or instantaneously read (scanned) in its entirety. Expand
  • 421
  • 37
  • PDF
The asynchronous computability theorem for t-resilient tasks
TLDR
We give necessary and sufficient combinatorial conditions characterizing the computational tasks that can be solved by N asynchronous processes, up to t of which can fail by halting. Expand
  • 198
  • 20
  • PDF
The Art of Multiprocessor Programming, Revised Reprint
Revised and updated with improvements conceived in parallel programming courses, The Art of Multiprocessor Programming is an authoritative guide to multicore programming. It introduces a higher levelExpand
  • 161
  • 20
  • PDF
A Lazy Concurrent List-Based Set Algorithm
TLDR
We present a novel “lazy” list-based implementation of a concurrent set object. Expand
  • 120
  • 16
  • PDF