In this exercise we consider the problem of [k, l] -election, which generalizes the usual election problem. The problem requires that all correct processes decide on either 0 ( "defeated") or 1 ( "elected"), and that the number of processes that decide 1 is between k and 1 (inclusive) .
(1) What are the uses of [k, l] -election ?
(2) Demonstrate that no deterministic 1-crash robust algorithm for [k, k] election exists (if 0 k N).
(3) Give a deterministic t-crash robust algorithm for [k, k + 2t] -election.
Text Book: Introduction to Distributed Algorithms By Gerard Tel.