Learn More
In the renaming task n+1 processes start with unique input names from a large space and must choose unique output names taken from a smaller name space, namely 0,1,...,K. To rule out trivial solutions, a protocol must be anonymous: the value chosen by a process can depend on its input name and on the execution, but not on the specific process id. Attiya et(More)
In the <i>renaming</i> task, <i>n</i>+1 processes start with unique input names from a large space and must choose unique output names taken from a smaller name space, 0,1,&#8230;, <i>K</i>. To rule out trivial solutions, a protocol must be <i>anonymous</i>: the value chosen by a process can depend on its input name and on the execution, but not on the(More)
In the renaming task n + 1 processes start with unique input names taken from a large space and must choose unique output names taken from a smaller name space, 0, 1, . . . , K. To rule out trivial solutions, a protocol must be anonymous: the value chosen by a process can depend on its input name and on the execution, but not on the specific process id.(More)
The <i>M</i>-renaming task requires <i>n+1</i> processes, each starting with a unique input name (from an arbitrary large range), to coordinate the choice of new output names from a range of size <i>M</i>. This paper presents the first upper bound on the complexity of <i>hard renaming</i>, i.e., <i>2n</i>-renaming, when <i>n+1</i> is not a prime power. It(More)
A protocol <i>P</i> is <i>Pareto-optimal</i> if no protocol <i>Q</i> can decide as fast as <i>P</i> for all adversaries, while allowing at least one process to decide strictly earlier, in at least one instance. Pareto optimal protocols cannot be improved upon. We present the first Pareto-optimal solutions to consensus and <i>k</i>-set consensus for(More)
In the k-set agreement task each process proposes a value, and it is required that each correct process has to decide a value which was proposed and at most k distinct values must be decided. Using topo-logical arguments it has been proved that k-set agreement is unsolvable in the asynchronous wait-free read/write shared memory model, when k < n, the number(More)
In the renaming problem, each process in a distributed system is issued a unique name from a large namespace, and the processes must coordinate with one another to choose unique names from a much smaller name space. We show that lower bounds on the solvability of renaming can be formulated as a purely topological question about the existence of an(More)
The set consensus problem has played an important role in the study of distributed systems for over two decades. Indeed, the search for lower bounds and impossibility results for this problem spawned the topological approach to distributed computing, which has given rise to new techniques in the design and analysis of protocols. The design of efficient(More)