'Alias nn alias alias' presentation slideshows

Minimum Spanning Tree

741 views • 36 slides

Leader Election

Leader Election. Let G = (V,E) define the network topology. Each process i has a variable L(i) that defines the leader . ? i,j ? V ? i,j are non-faulty :: L(i) ? V ? L(i) = L(j) ? L(i) is non-faulty Often reduces to maxima (or minima) finding problem. Bully algorithm.

506 views • 19 slides

Leader Election

Leader Election. Let G = (V,E) define the network topology. Each process i has a variable L(i) that defines the leader . ? i,j ? V ? i,j are non-faulty :: L(i) ? V ? L(i) = L(j) ? L(i) is non-faulty Often reduces to maxima (or minima) finding problem. Bully algorithm.

194 views • 19 slides

Leader Election

Leader Election. Let G = (V,E) define the network topology. Each process i has a variable L(i) that defines the leader . ? i,j ? V ? i,j are non-faulty :: L(i) ? V and L(i) = L(j) and L(i) is non-faulty Often reduces to maxima (or minima) finding problem .

183 views • 16 slides

Leader Election

Leader Election. Let G = (V,E) define the network topology. Each process i has a variable L(i) that defines the leader . ? i,j ? V ? i,j are non-faulty :: L(i) ? V and L(i) = L(j) and L(i) is non-faulty Often reduces to maxima (or minima) finding problem.

163 views • 13 slides