N. Shavit

Publications
Influence

David Dice, Ori Shalev, N. Shavit
Computer Science
DISC
18 September 2006

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

N. Shavit, D. Touitou
Computer Science
PODC '95
20 August 1995

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

M. Herlihy, N. Shavit
Computer Science
PODC '06
6 October 2020

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

The topological structure of asynchronous computability

M. Herlihy, N. Shavit
Computer Science
JACM
1 November 1999

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

Software transactional memory

N. Shavit, D. Touitou
Computer Science
Distributed Computing
12 February 1997

We offer software transactional memory (STM), a novel software method for supporting flexible transactional programming of synchronization operations. Expand

Flat combining and the synchronization-parallelism tradeoff

D. Hendler, I. Incze, N. Shavit, Moran Tzafrir
Computer Science
SPAA '10
13 June 2010

We introduce a new synchronization paradigm based on coarse locking, which we call flat combining. Expand

Atomic snapshots of shared memory

Y. Afek, D. Dolev, H. Attiya, E. Gafni, M. Merritt, N. Shavit
Computer Science
PODC '90
1 August 1990

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

The asynchronous computability theorem for t-resilient tasks

M. Herlihy, N. Shavit
Mathematics, Computer Science
STOC '93
1 June 1993

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

The Art of Multiprocessor Programming, Revised Reprint

M. Herlihy, N. Shavit
Computer Science
25 June 2012

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 level… Expand

A Lazy Concurrent List-Based Set Algorithm

S. Heller, M. Herlihy, Victor Luchangco, M. Moir, William N. Scherer, N. Shavit
Computer Science
Parallel Process. Lett.
1 December 2007

We present a novel “lazy” list-based implementation of a concurrent set object. Expand

Recommended Authors