EMERGING TRENDS IN COMPUTING
CLOUD COMPUTING
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
In a Classical Algorithm of Ring Election, what will be the message complexity for N labelled processes?
|
|
(N-1) messages
|
|
|
(2N-1) messages
|
|
|
(3N-1) messages
|
|
|
(4N-1) messages
|
Explanation:
Detailed explanation-1: -This algorithm runs in O(n2) time in the worst case when lowest ID process initiates the election. The name bully is given to the algorithm because the higher ID processes are bullying the lower ID processes to drop out of the election.
Detailed explanation-2: -The message complexity of an algorithm assigns to each N the maximum number of messages used by the algorithm on distributed systems with N processors.
Detailed explanation-3: -“Leader Election problem represents a general class of non symmetry-breaking problems.” Yes, the answer is correct.
There is 1 question to complete.