1. Homepage
  2. Exam
  3. [2019] COMPSCI 711 Parallel and Distributed Computing - Bellman-Ford Algorithm

[2019] COMPSCI 711 Parallel and Distributed Computing - Bellman-Ford Algorithm

This question has been solved
Engage in a Conversation

Question 7 CourseNana.COM


CourseNana.COM

(a) What is the goal of the distributed Bellman-Ford algorithm, what does it try to achieve (DFS, BFS, MST, or otherwise)? CourseNana.COM

CourseNana.COM


CourseNana.COM

(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. CourseNana.COM

CourseNana.COM


CourseNana.COM

(c) Based on (b), discuss how the time complexity can also be exponential, in the FIFO scenario. CourseNana.COM

CourseNana.COM

CourseNana.COM

CourseNana.COM

CourseNana.COM

CourseNana.COM

CourseNana.COM

Get the Solution to This Question

WeChat WeChat
Whatsapp WhatsApp