On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Extended impossibility results for asynchronous complete networks
Information Processing Letters
Computing on an anonymous ring
Journal of the ACM (JACM)
Tight bounds for shared memory symmetric mutual exclusion problems
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Wakeup under read/write atomicity
Proceedings of the 4th international workshop on Distributed algorithms
Bounds on shared memory for mutual exclusion
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Possibility and impossibility results in a shared memory environment
Acta Informatica
SIAM Journal on Computing
A lower bound on wait-free counting
Journal of Algorithms
On the space complexity of randomized synchronization
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time and Space Lower Bounds for Nonblocking Implementations
SIAM Journal on Computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Closed schedulers: a novel technique for analyzing asynchronous protocols
Distributed Computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Relationships between broadcast and shared memory in reliable anonymous distributed systems
Distributed Computing - Special issue: DISC 04
Proceedings of the 28th ACM symposium on Principles of distributed computing
The anonymous consensus hierarchy and naming problems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Brief announcement: byzantine agreement with homonyms
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Byzantine agreement with homonyms
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A knowledge-based analysis of global function computation
DISC'06 Proceedings of the 20th international conference on Distributed Computing
What can be implemented anonymously?
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On the power of anonymous one-way communication
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Anonymous agreement: the janus algorithm
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Byzantine agreement with homonyms in synchronous systems
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Homonyms with forgeable identifiers
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Byzantine agreement with homonyms in synchronous systems
Theoretical Computer Science
| Hi-index | 0.00 |
In the totally anonymous shared memory model of asynchronous distributed computing, processes have no identifiers and run identical programs. Moreover, processes have identical interface to the shared memory, and in particular, there are no single-writer registers. This paper assumes that process do not fail, and the shared memory consists only of read/write registers, which are initialized default value. A complete characterization of the functions and agreement tasks that can be solved in this model is presented. Furthermore, it is shown that if a function is computable, then two registers are sufficient for some algorithm to compute it. Consensus is an important agreement task that can be computed. The paper proves logarithmic lower bounds on the number of registers and rounds needed for solving consensus in this model. A consensus protocol using a linear number of shared registers and rounds is also presented.