![]() These new friends have the most common friends with that person but are not his/her friends. Suggesting some, for example 10, new friends to a person using Spark. This algorithm is explained in 1 in detail. At the end, evey node should know its neighbor in the tree. ![]() In this algorithm, nodes talk to each other to find a minimum spanning tree between themeselves. 2 Gallager-Humblet-Spira (GHS) Minimum Spanning Tree Algorithm Nodes in a a given topology exchange messages in an asynchronous manner until they come to a consensus on their valuse. ![]() ![]() Bellman-Ford Shortest Path AlgorithmÄesired topology is fed into the code with a predefined format, then message passing starts so that finally a specified node, that does not have a central view of the network, knows the shortest path to evey other nodes. ![]() IDs and link delays are passed to the nodes in a circular topology in clockwise order, then they start to exchange required messages until a leader is founded with the help of LCR algorithm explained in Distributed Algorithms by Nancy A. Implementation LCR leader election, Bellman-Ford shortest path, Paxos consensus algorithm, and GHS minimum spanning tree algorithms using socket programming as well as distributed computation of a page rank and a friend suggestion method using Spark. These assignments were part of my undergrad coursework at Sharif UT. ![]()
0 Comments
Leave a Reply. |