Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Atomic snapshots of shared memory
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
From binary consensus to multivalued consensus in asynchronous message-passing systems
Information Processing Letters
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
The BG distributed simulation algorithm
Distributed Computing
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
DISC'06 Proceedings of the 20th international conference on Distributed Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
The committee decision problem
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
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
From adaptive renaming to set agreement
Theoretical Computer Science
From renaming to set agreement
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
On adaptive renaming under eventually limited contention
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
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
The renaming problem in shared memory systems: An introduction
Computer Science Review
| Hi-index | 0.00 |
Recently Mostefaoui, Raynal, and Travers [1] showed that with the use of k-set-consensus they can strongly rename n processors into the range of 2n–⌈n/k ⌉. That is the overhead is n–⌈n/k ⌉. Here we reduce the range to n+k–1, i.e. we reduce the overhead to k–1. For k=c the improvement in the overhead is O(n). We first argue that such an algorithm using topological embedding does exist. We then come-up with a novel explicit algorithm that does not require explicit embedding. The latter technique employed is of independent importance and interest.