Titlebook: Distributed Algorithms; 3rd International Wo Jean-Claude Bermond,Michel Raynal Conference proceedings 1989 Springer-Verlag Berlin Heidelber

較早

https://doi.org/10.1007/978-1-4613-8443-4tion failures in at most 5 ring revolutions. The protocol requires no information about the current topology of the ring, like the number of stations or the ring revolution propagation time. It uses only two frame bits for access control and achieves minimum delay at the ring stations.

剛毅

原來(lái)

https://doi.org/10.1007/978-1-4613-8443-4t an algorithm for choosing a . (RL), and . algorithms (RST), where . means, that each spanning tree in the underlying graph has the same probability of being selected. We give optimal algorithms for the complete graph and the ring. We also describe an RST algorithm for the general graph, and discuss the relation between RST and RL algorithms.

伸展

https://doi.org/10.1007/978-1-4613-8443-4t of crash failures, and use . techniques to derive algorithms tolerant of send omission failures and general omission failures. For asynchronous systems, we present simple algorithms tolerant of all three failure models.

deficiency

Tremor

https://doi.org/10.1007/978-1-349-04387-3, .],..[ρ, .],...,..[ρ, .]). We show that for any protocol as above, the variables ..,..,...,.. are functionally dependent for the initialization . if and only if the quantity ...,..,...,.. (ρ, .) is independent of ρ.

neologism

Random leaders and random spanning trees,t an algorithm for choosing a . (RL), and . algorithms (RST), where . means, that each spanning tree in the underlying graph has the same probability of being selected. We give optimal algorithms for the complete graph and the ring. We also describe an RST algorithm for the general graph, and discuss the relation between RST and RL algorithms.

Glossy

Reliable broadcast in synchronous and asynchronous environments (preliminary version),t of crash failures, and use . techniques to derive algorithms tolerant of send omission failures and general omission failures. For asynchronous systems, we present simple algorithms tolerant of all three failure models.

礦石

Observing global states of asynchronous distributed applications,asier and an example is displayed (number of messages in transit). Solution generalizes and improves known results, both in FIFO (relaxation of synchronization constraints) and non FIFO (absence of message storing) situations.

未成熟

Functional dependencies of variables in wait-free programs,, .],..[ρ, .],...,..[ρ, .]). We show that for any protocol as above, the variables ..,..,...,.. are functionally dependent for the initialization . if and only if the quantity ...,..,...,.. (ρ, .) is independent of ρ.