EMERGING TRENDS IN SOFTWARE ENGINEERING
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: -The Ring Algorithm – This algorithm applies to systems organized as a ring(logically or physically). In this algorithm, we assume that the link between the process is unidirectional and every process can message to the process on its right only.
Detailed explanation-2: -message complexity denotes the maximum number of messages transmitted over any edge. The time complexity of a distributed algorithm is traditionally defined as the number of communication rounds until the last node completes the algorithm.
There is 1 question to complete.