CS8603:Distributed Systems Department of CSE
2020 – 2021 2.
11
Jeppiaar Institute of Technology
(1a)
send M(i,G) to central coordinator.
(2) When M(i,G) arrives from Pi at the central coordinator:
(2a)
send M(i,G) to all members of the group G.
(3) When M(i,G) arrives at Pj from the central coordinator:
(3a)
deliver M(i,G) to the application.
Complexity
Each message transmission takes two message hops
and exactly n messages
in a system of n processes.
Drawbacks
• A centralized algorithm has a single point of failure and congestion
Chia sẻ với bạn bè của bạn: