(Solved) : Parallel Computing Solve Problem Processors Communicate Others Round Round Round Processor Q34868280 . . .
In parallel computing, to solve a problem, processorscommunicate with others round by round.
In each round, processors can concurrently read or exclusivelywrite(CREW) on shared memory,
i.e., multiple processors can read a shared memory cell, butonly one can write to a given cell at a
time. Given a weighted undirected graph G = (V, E), where |V| =n and edge weight are distinct.
There are |E| processors and each processor Pi hasthe input of a unique edge Ei = {u, v} and its
weight w(Ei). Every shared memory cell can hold O(logn) bits. To solve the minimum spanning
tree of G, because every processor has only partial informationof G, it needs to communicate
with others and then decide whether its input edge is in the MSTor not. Design an algorithm
to solve MST in O(n log n) rounds. Values in the input to theproblem are of size O(log n) bits. A
cell can hold at most constant number of such values, i.e., thewhole description of G cannot be
written in a single cell. The output is each processordetermines whether its edge is in the MST
or not. (Hint: Notice that in this setting if we have apolynomial of n number of processor each
holding a value then the minimum value can be found in O(log n)time. To use this assumption
you have to show how to do it.)
Expert Answer
Answer to Parallel Computing Solve Problem Processors Communicate Others Round Round Round Processor Q34868280 . . .
OR