[2019] COMPSCI 711 Parallel and Distributed Computing - Bellman-Ford Algorithm
Question 7
(a) What is the goal of the distributed Bellman-Ford algorithm, what does it try to achieve (DFS, BFS, MST, or otherwise)?
(b) Discuss the exponential message complexity of the asynchronous Bellman-Ford algorithm. Base your discussion on the sample diagram below - which is a simplified version of the diagram used in the lectures.
(c) Based on (b), discuss how the time complexity can also be exponential, in the FIFO scenario.
Get the Solution to This Question
WeChat (微信)
WhatsApp
