Nir Shavit
MIT, Cambridge, MA, USA
-
Software Transactional Memory
fourteenth annual ACM symposium on Principles of distributed computing, 1995 – PODC
As we learn from the literature, flexibility in choosing synchroni~ation operations greatly simplifies the task of designing highly concurrent programs. Unfortunately, existing hardware is inflexible and is at best on the level of a ...
bibtex -
Transactional Locking II
Distributed Computing, 20th International Symposium, DISC 2006, vol. 4167,2006 – DISC
Abstract. The transactional memory programming paradigm is gaining momentum as the approach of choice for replacing locks in concurrent programming. This paper introduces the transactional locking II (TL2) algorithm, a software transactional memory ...
bibtex -
The asynchronous computability theorem for t-resilient tasks
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993 – STOC
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. The range of possible input and output values for an asynchronous ...
bibtex -
Atomic Snapshots of Shared Memory
Journal of the ACM, vol. 40,no. 4,1993 – JACM
This paper introduces a general formulation of atomic snapshot memory, a shared memory partitioned into words written (updated) by individual processes, or instantaneously read (scanned) in its entirety. This paper presents three wait-free ...
bibtex -
Parallel Garbage Collection for Shared Memory Multiprocessors
Proceedings of the 1st Java Virtual Machine Research and Technology Symposium, 2001 – (Java) Virtual Machine Research and Technology Symposium
We present a multiprocessor "stop-the-world" garbage collection framework that provides multiple forms of load balancing. Our parallel collectors use this framework to balance the work of root scanning, using static ...
bibtex -
The topological structure of asynchronous computability
Journal of the ACM, vol. 46,no. 6,1999 – JACM
We give necessary and sufficient combinatorial conditions characterizing the class of decision tasks that can be solved in a wait-free manner by asynchronous processes that communicate by reading and writing a shared memory. We introduce a new ...
bibtex -
Counting Networks and Multi-Processor Coordination
Proceedings of the twenty-third annual ACM Symposium on Theory of Computing, STOC 1991, 1991 – STOC
Many fundamental multi-processor coordination problems can be expressed aa counting problems: processes must, cooperate to assign successive values from a given range, such as addresses in memory or destinations on an interconnection network. ...
bibtex -
Counting Networks
Journal of the ACM, vol. 41,no. 5,1994 – JACM
Many fundamental multi-processor coordination problems can be expressed as counting problems: Processes must cooperate to assign successive values from a given range, such as addresses in memory or destinations on an interconnection network. ...
bibtex -
bibtex
-
Bounded Polynomial Randomized Consensus
eighth annual ACM Symposium on Principles of distributed computing, 1989 – PODC
In [A&3], Abrahamson presented a solution to the randomized consensus problem of Chor, Israeli and Li [CIL87], without assuming the existence of an atomic coin flip operation. This elegant algorithm uses unbounded memory, and has expected ...
bibtex
