Elizabeth Borowsky
- 1.Y. Afek, H. Attiya., D. Dolev, E. Ga.fni, M. Merritt, and N. Shavit, "Atomic Snai)shots of Shared Memory," Proc. 9th A CM,5"ymp. o~ Principles of Distributed Coputing pages 1- 14, 1990. Google Scholar
- 2.S. Owiki, "Axiomatic Proof Techniques for Parallel Programs," PhD Thesis, Cornell University, 1975. Google ScholarDigital Library
- 3.S. Owiki and D. Gries, "All Axiomatic Proof Technique for Parallel Programs," Acta Iaformatica, 6, 319-340. 1976.Google ScholarDigital Library
- 4.A. Bar-Noy, and D. Dolev, "Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment," Proc. 8 A CM Syrup. on Principles of Distributed Computing, pages 307-318, 1989. Google ScholarDigital Library
- 5.G.L. Peterson, "Myths about the Mutual Exclusion Problem," Infbrmation Processing Letters, 12, 115-116, 1981.Google ScholarCross Ref
- 6.C. Paris and A. Shvartsman, "Efficient Parallel Algorithms on Restartable Fail-Stop Processors,'' Proc. 10 A CM Syrup. on Principles of' Distributed Computing, pages 23-37, 1991. Google ScholarDigital Library
- 7.L. La.mport, "A Fast Mutual Exclusion Algorithm,'' A CM Trans. Comp. Sys., 5, 1-11, 1987. Google ScholarDigital Library
- 8.H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk, "Achievable Cases in an Asynchronous Environment", Pvoc. 28th IE~E Syrup. on Fou~dations of Computer Science, pages 337-346, 1987.Google ScholarDigital Library
- 9.O. Biran, S. Moran, and S. Zaks, "A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor," Proc. 7th A UM Syrup. on Pri,~ciple.s of Distributed Computing, pages 263-275, 1988. Google ScholarDigital Library
- 10.A. Afek, D. Dotev. E. Gafni. ~I. Merritt, and N. Shavit, "First-in-First-Enabled 1- Exclusion,'' Proc. 4th Inter'national tForkshop on Distributed Algorithn,.s. 1990. Google ScholarDigital Library
- 11.M. Saks, and F. Za.ha.roglou." Wait-Free k- Set Agreement is Impossible: The Topology of Public Knowledge," to appear in STOC93. Google ScholarDigital Library
- 12.M. Herlihy and N. Shavit, "The Asynchronous Computability Theorem for t- Resilient Tasks," to appear in STOC93. Google ScholarDigital Library
- 13.E. Borowsky a.nd E. Gafi~i, "Generalized FLP Impossibility Result for t-Resilient. Asynchronous Computations," to appear ill STOC93. Google ScholarDigital Library
- 14.M. Choy and A.K. Singh, "Adaptive Solutions to the Mutual Exclusion Problem." this proceedings. Google ScholarDigital Library
- 15.H. Attiya, M. Herlihy, and O. Rachman, "Efficient Atomic Snapshots Using Lattice Agreement, ''Proc 6th lntcrnationetI IVovkshop o'l~ Distributed Algorithm.s, pages 35-53. 1992. Google ScholarDigital Library
Index Terms
- Immediate atomic snapshots and fast renaming
Recommendations
Atomic snapshots of shared memory
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 ...
Atomic snapshots using lattice agreement
The snapshot object is an important tool for constructing wait-free asynchronous algorithms. We relate the snapshot object to the lattice agreement decision problem. It is shown that any algorithm for solving lattice agreement can be transformed into an ...
Fast non-blocking atomic commit: an inherent trade-off
This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t ≥ 3 an inherent trade-off between the fast abort property ...
Comments