Titlebook: Distributed Algorithms; 5th International Wo Sam Toueg,Paul G. Spirakis,Lefteris Kirousis Conference proceedings 1992 Springer-Verlag Berli

BRAND

Discrete

Canyon

More on the power of random walks: Uniform self-stabilizing randomized algorithms,processors in the system. Let . be the underlying interconnection network. If . is a known bound on the network size then our protocol uses O(C.NlogN) bits and stabilizes within O(C.) rounds where C. is the . of .. The protocol is uniform, tolerates dynamic changes of the network topology, and works

cringe

少量

摘要

Implementing FIFO queues and stacks,e is the worst-case response time in distributed implementations of virtual shared memory supporting one of the two conditions. The worst-case response time is very sensitive to the assumptions that are made about the timing information available to the system. All the results in this paper assume t

鋼盔

傻

Optimally simulating crash failures in a byzantine environment,ers have simplified this task by developing methods that . translate protocols tolerant of “benign” failures into ones tolerant of more “severe” failures. In addition to simplifying the design task, these translations can provide insight into the relative impact of different models of faulty behavio

Haphazard

,Efficient distributed consensus with n=(3 + ?)t processors, correct must agree on one of the initial values. We measure the quality of a consensus protocol by the following parameters: the total number of processors ., the number of rounds of message exchange ., and the communication complexity, given by the maximal message size..This paper presents a proto

和平主義

Using adaptive timeouts to achieve at-most-once message delivery,ission time and degree of clock synchronization. The performance of their algorithm depends on its being supplied with a good estimate of the maximum message lifetime—the sum of the message delivery time and the difference in processor clock values between sender and recipient. We present two algori