Richard J. Anderson
- AH90.J. Aspnes and M. Herlihy. Wait-free data structures in the asynchronous PRAM model. in Second Annual Symposium on Parallel Algorithms and Architectures, pages 340-349, 1990. Google Scholar
Digital Library
- And90.R. J. Anderson. Parallel algorithms for generating random permutations on a shared memory machine. In Second Annual Symposium on Parallel Algorithms and Architectures, pages 95-102, 1990. Google ScholarDigital Library
- And91.R. J. Anderson. Wait-free primitives for list compression. Work in progress, 1991.Google Scholar
- BR90.J. Buss and P. Ragde. Certified write-all on a strongly asynchronous P RAM. Preliminary Report, 1990.Google Scholar
- CV86.R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel llst ranking. Information and Computation, 70:32-53, 1986. Google ScholarDigital Library
- Gib89.P. Gibbons. A more practical PRAM model. In 1989 A CM Symposium on Parallel Algorithms and Architectures, pages 158-168, 1989. Google ScholarDigital Library
- Her88.M. Herlihy. Impossibility and universality results for wait-free synchronization. In Proceedings of the Seventh Annual A CM Symposium on Principles of Distributed Computing, pages 276-291, 1988. Google ScholarDigital Library
- Her90.M. Herlihy. A methodology for implementing highly concurrent data structures. In Second A CM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 197-206, 1990. Google ScholarDigital Library
- HW87.M. P. Herlihy and J. M. Wing. Axioms for concurrent objects. In Proceedings of the Fourteenth Annual A CM Symposium on Principles of Programming Languages, pages 13- 26, 1987. Google ScholarDigital Library
- KPS90.Z.M. Kedem, K. V. Palem, and P. G. Spiraids. Efficient robust parallel computations. In Proceedings of the 22nd A CM Symposium on Theory of Computation, pages 138-148, 1990. Google ScholarDigital Library
- KS89.P. Kanellakis and A. Shvartsman. Efficient parallel algorithms can be made robust. In Proceedings o.f the Eighth Annual A CM Symposium on Principles of Distributed Computing, pages 211-222, 1989. Google ScholarDigital Library
- MSP90.C. Martel, R. Subramonian, and A. Park. Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In 31st Symposium on Foundations of Computer Science, pages 590-599, 1990.Google ScholarDigital Library
- Nis90.N. Nishimura. Asynchronous shared memory parallel computation. In Second Annual Symposium on Parallel Algorithms and Architectures, pages 76-84, 1990. Google ScholarDigital Library
- RZ89.R.Cole and O. Zajicek. The APRAM: Incorporating asynchrony into the P RAM model. In 1989 A CM Symposium on Parallel Algorithms and Architectures, pages 169-178, 1989. Google ScholarDigital Library
- RZ90.R.Cole and O. Zajicek. The expected advantage of asynchrony. In Second Annual Symposium on Parallel Algorithms and Architectures, pages 85-94, 1990. Google ScholarDigital Library
- Tar83.R.E. Tarjan. Data Structures and Network Algorithms. SIAM, 1983. Google ScholarDigital Library
Index Terms
- Wait-free parallel algorithms for the union-find problem
Recommendations
Are Lock-Free Concurrent Algorithms Practically Wait-Free?
Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make ...
A methodology for creating fast wait-free data structures
PPoPP '12: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel ProgrammingLock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. While many practical lock-free algorithms exist, wait-free algorithms are ...
Operation-Level Wait-Free Transactional Memory with Support for Irrevocable Operations
Transactional memory (TM) aims to be a general purpose concurrency mechanism. However, operations which cause side-effects cannot be easily managed by a TM system, in which transactions are executed optimistically. In particular, networking, I/O, and some ...
Comments