Eli Gafni

Generalized FLP impossibility result for t -resilient asynchronous computations

Demarcation of the border between solvable and unsolvable distributed tdis under various models is the holy grail of the theory of distributed computing. Oneof the most celebrated of theseresults is [6] (FLP) which established the impossibility of asynchronous consensus that can tolerate a single undetected fail-stop processor. This paper generalizes FLP to multiple faults. It establishes that k-set consensus proposed by Chaudhuri is impossible, if the protocol is to tolerate k failures, while there exists a protocol that tolerates k – 1 failures. Our proof technique is completely different than the one employed in [6]. We introduce a new model of computation, the im112ecliate-atoY12 ic-.s?2u~)shot. We fully characterize the graph of waitfree views within the model. Applying a variant of Sperner Lemma to this graph establishes the impossibility of k + 1 processors achieving waitfree k-set consensus. Finally, we introduce a new notion of nonblocking-busy-wait agreement protocol, With this ● Work supported by NSF Presiciential Young Iavest,igator Award under grant DCR84-51396 . Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direot commercial advantage, the ACM copyright notica and the title of the publication and its data appear, and notica is givan that copying is by permission of the Association for Computing Machinery. To copy otherwisa, or to republish, requiras a fea and/or specific permission. 25th ACM STOC ‘93-51931CA,USA @ 1993 ACM 0.89791.591-7/93/0005/0091 .,C

Two-Metric Projection Methods for Constrained Optimization

l .5(3 protocol we construct a read/write waitfree simulation techniclue by which k + 1 processors can produce a k-faulty execution of n processors protocol, {Tsing the simulation we establish the impossibility of n processors protocol that achieves k-set consensus and tolerates k failures, by reducing it to the waitfree case.

Immediate atomic snapshots and fast renaming

This paper is concerned with the problem min

Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks

\{ f(x)\mid x \in X\}

Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony

where X is a convex subset of a linear space H, and f is a smooth real-valued function on H. We propose the class of methods

Efficient Methods for Integrating Traceability and Broadcast Encryption

x_{k + 1} = P(x_k - \alpha _k g_k )

Applying static network protocols to dynamic networks

, where P denotes projection on X with respect to a Hilbert space norm

The BG distributed simulation algorithm

\| \cdot \|

Concurrency in heavily loaded neighborhood-constrained systems

,

Projected Newton methods and optimization of multicommodity flows

g_k