On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
An O(lg n) expected rounds randomized Byzantine generals protocol
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Extended impossibility results for asynchronous complete networks
Information Processing Letters
Fault-tolerant decision making in totally asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Fault-Tolerant Critical Section Management in Asynchronous Networks
Proceedings of the 3rd International Workshop on Distributed Algorithms
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Asynchronous Byzantine consensus
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Lower bounds for wait-free computation in message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Bounds on the time to reach agreement in the presence of timing uncertainty
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Knowledge in shared memory systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
A simple constructive computability theorem for wait-free computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Set consensus using arbitrary objects (preliminary version)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Fail-awareness in timed asynchronous systems
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The decidability of distributed decision tasks (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Towards a topological characterization of asynchronous complexity
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Unifying synchronous and asynchronous message-passing models
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fast, wait-free (2k-1)-renaming
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Adaptive and efficient mutual exclusion (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Stability of long-lived consensus (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
On k-Set Consensus Problems in Asynchronous Systems
IEEE Transactions on Parallel and Distributed Systems
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Randomized initialization protocols for radio networks
Handbook of wireless networks and mobile computing
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Polynominal and Adaptive Long-Lived (2k-1)-Renaming
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Adaptive and efficient mutual exclusion
Distributed Computing
Algorithms adapting to point contention
Journal of the ACM (JACM)
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
Stability of long-lived consensus
Journal of Computer and System Sciences
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Computable obstructions to wait-free computability
Distributed Computing
Randomized naming using wait-free shared variables
Distributed Computing
Long lived adaptive splitter and applications
Distributed Computing
An adaptive collect algorithm with applications
Distributed Computing
Closed schedulers: a novel technique for analyzing asynchronous protocols
Distributed Computing
Knowledge in shared memory systems
Distributed Computing
Using local-spin k-exclusion algorithms to improve wait-free object implementations
Distributed Computing
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
Lock-free dynamic hash tables with open addressing
Distributed Computing - Special issue: PODC 02
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Lower bounds for randomized consensus under a weak adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Asynchronous exclusive selection
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Locks Considered Harmful: A Look at Non-traditional Synchronization
SEUS '08 Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
The 0---1-Exclusion Families of Tasks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
From adaptive renaming to set agreement
Theoretical Computer Science
The extended BG-simulation and the characterization of t-resiliency
Proceedings of the forty-first annual ACM symposium on Theory of computing
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
From renaming to set agreement
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Tight group renaming on groups of size g is equivalent to g-consensus
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The multiplicative power of consensus numbers
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The topology of shared-memory adversaries
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Note: Strong order-preserving renaming in the synchronous message passing model
Theoretical Computer Science
The failure detector abstraction
ACM Computing Surveys (CSUR)
Scalable flat-combining based synchronous queues
DISC'10 Proceedings of the 24th international conference on Distributed computing
Fast randomized test-and-set and renaming
DISC'10 Proceedings of the 24th international conference on Distributed computing
Recursion in distributed computing
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
On adaptive renaming under eventually limited contention
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Generating fast indulgent algorithms
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Solving the at-most-once problem with nearly optimal effectiveness
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Optimal-time adaptive strong renaming, with applications to counting
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The universe of symmetry breaking tasks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A survey on some recent advances in shared memory models
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
The universe of symmetry breaking tasks
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
ACM SIGACT News
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
Renaming with k-set-consensus: an optimal algorithm into n + k - 1 slots
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Adapting to point contention with long-lived safe agreement
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
New combinatorial topology bounds for renaming: The upper bound
Journal of the ACM (JACM)
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Renaming in message passing systems with byzantine failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Fully-adaptive algorithms for long-lived renaming
DISC'06 Proceedings of the 20th international conference on Distributed Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Solving the at-most-once problem with nearly optimal effectiveness
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
On the implementation of concurrent objects
Dependable and Historic Computing
An equivariance theorem with applications to renaming
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Renaming is weaker than set agreement but for perfect renaming: a map of sub-consensus tasks
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Electronic Notes in Theoretical Computer Science (ENTCS)
The renaming problem in shared memory systems: An introduction
Computer Science Review
Deterministic multi-channel information exchange
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
A closer look at fault tolerance
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Early deciding synchronous renaming in o( logf) rounds or less
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Towards a computing model for open distributed systems
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
On the power of impersonation attacks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Oblivious assignment with m slots
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Computability in distributed computing: a Tutorial
ACM SIGACT News
Counting-based impossibility proofs for renaming and set agreement
DISC'12 Proceedings of the 26th international conference on Distributed Computing
The strong at-most-once problem
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Randomized loose renaming in o(log log n) time
Proceedings of the 2013 ACM symposium on Principles of distributed computing
How to meet asynchronously at polynomial cost
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Upper bound on the complexity of solving hard renaming
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Byzantine renaming in synchronous systems with t
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Learning a ring cheaply and fast
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
ACM SIGACT News
Computing with infinitely many processes
Information and Computation
| Hi-index | 0.01 |
This paper is concerned with the solvability of the problem of processor renaming in unreliable, completely asynchronous distributed systems. Fischer et al. prove in [8] that “nontrivial consensus” cannot be attained in such systems, even when only a single, benign processor failure is possible. In contrast, this paper shows that problems of processor renaming can be solved even in the presence of up to t n/2 faulty processors, contradicting the widely held belief that no nontrivial problem can be solved in such a system. The problems deal with renaming processors so as to reduce the size of the initial name space. When only uniqueness of the new names is required, we present a lower bound of n + 1 on the size of the new name space, and a renaming algorithm that establishes an upper bound on n + t. If the new names are required also to preserve the original order, a tight bound of 2′(n - t + 1) - 1 is obtained.