Share This Author
Transactional Locking II
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 global version-clock based validation technique, which is ten-fold faster than a single lock.
The art of multiprocessor programming
This talk will survey the area ofTransactional memory, a computational model in which threads synchronize by optimistic, lock-free transactions, with a focus on open research problems.
Software transactional memory
STM is used to provide a general highly concurrent method for translating sequential object implementations to non-blocking ones based on implementing a k-word compare&swap STM-transaction, and outperforms Herlihy’s translation method for sufficiently large numbers of processors.
The topological structure of asynchronous computability
This work introduces a new formalism for tasks, based on notions from classical algebraic and combinatorial topology, in which a task''s possible input and output values are each associated with high-dimensional geometric structures called simplicial complexes, and characterize computability in terms of the topological properties of these complexes.
Flat combining and the synchronization-parallelism tradeoff
This work uses flat-combining to devise, among other structures, new linearizable stack, queue, and priority queue algorithms that greatly outperform all prior algorithms.
Atomic snapshots of shared memory
- Y. Afek, D. Dolev, H. Attiya, E. Gafni, Michael Merritt, N. Shavit
- Computer SciencePODC '90
- 1 August 1990
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 is introduced.
Deep Learning is Robust to Massive Label Noise
It is shown that deep neural networks are capable of generalizing from training data for which true labels are massively outnumbered by incorrect labels, and that training in this regime requires a significant but manageable increase in dataset size that is related to the factor by which correct labels have been diluted.
The asynchronous computability theorem for t-resilient tasks
The main theorem characterizes computability y in terms of the topological properties of a simplicial complex so that a given task is computable only if it can be associated with a complex that is simply connected with trivial homology groups.
A Lazy Concurrent List-Based Set Algorithm
- S. Heller, M. Herlihy, Victor Luchangco, Mark Moir, William N. Scherer, N. Shavit
- Computer ScienceParallel Process. Lett.
- 12 December 2005
We present a novel “lazy” list-based implementation of a concurrent set object. It is based on an optimistic locking scheme for inserts and removes and includes a simple wait-free membership test.…
The Art of Multiprocessor Programming, Revised Reprint
This revised edition of The Art of Multiprocessor Programming incorporates much-demanded updates throughout the book, based on feedback and corrections reported from classrooms since 2008.