Communication-efficient and crash-quiescent Omega with unknown membership

The failure detector class Omega (Ω) provides an eventual leader election functionality, i.e., eventually all correct processes permanently trust the same correct process. An algorithm is communication-efficient if the number of links that carry messages forever is bounded by n, being n the number of processes in the system. It has been defined that an algorithm is crash-quiescent if it eventually stops sending messages to crashed processes. In this regard, it has been recently shown the impossibility of implementing Ω crash quiescently without a majority of correct processes. We say that the membership is unknown if each process pi only knows its own identity and the number of processes in the system (that is, i and n), but pi does not know the identity of the rest of processes of the system. There is a type of link (denoted by ADD link) in which a bounded (but unknown) number of consecutive messages can be delayed or lost. In this work we present the first implementation (to our knowledge) of Ω in partially synchronous systems with ADD links and with unknown membership. Furthermore, it is the first implementation of Ω that combines two very interesting properties: communication-efficiency and crash-quiescence when the majority of processes are correct. Finally, we also obtain with the same algorithm a failure detector () such that every correct process eventually and permanently outputs the set of all correct processes.

Cancellation zone in supersonic lifting wing theory

BASING their work on a linear theory, Evvard1 and Krasilshchikova2'3 independently developed an expression that yields the perturbation generated by a thiri lifting wing of arbitrary planform flying at supersonic speed on a point placed on the wing plane inside its planform,1 or both on and above the wing plane.2 This point must be influenced by two leading edges, one supersonic and the other partially subsonic. Although these authors followed different approaches, their methods concur in showing the existence of a perfectly defined cancellation zone. In this Note, the Evvard approach is generalized to the case solved by Krasilshchikova. Circumventing the latter's lengthy and somewhat complex approach, Evvard's simple method seems to be useful at least for educational purposes.