Computing in Totally Anonymous Asynchronous Shared Memory Systems
Authors:
- Hagit AttiyaHAHagit Attiya
- Alla GorbachAGAlla Gorbach
- Shlomo MoranSMShlomo Moran
- 1 March 2002
- journal article
- Published by Elsevier in Information and Computation
- Vol. 173 (2) , 162-183
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Time and Space Lower Bounds for Nonblocking ImplementationsSIAM Journal on Computing, 2000
- On the space complexity of randomized synchronizationJournal of the ACM, 1998
- The Wakeup ProblemSIAM Journal on Computing, 1996
- Closed schedulers: a novel technique for analyzing asynchronous protocolsDistributed Computing, 1995
- Bounds on Shared Memory for Mutual ExclusionInformation and Computation, 1993
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Computing on an anonymous ringJournal of the ACM, 1988
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982