Give the procedures and their communications times for oneto

\"Give the procedures and their communications times for one-to-all personalized communication of m-word messages on p nodes for a mesh architecture.\"

times for Give the procedures and their communication times for all personalized communication of m-word messages on p nodes for the mesh architectures

Solution

procedure ALL_TO_ALL_BC_RING(my_id, my_msg, p, result)
begin
    left := (my_id - 1) mod p;
    right := (my_id + 1) mod p;
    result := my_msg;
    msg := result;
    for i := 1 to p - 1 do
        send msg to right;
        receive msg from left;
        result := result msg;
    endfor;
end ALL_TO_ALL_BC_RING

In this algorithm the entire message received by a processor is not required by that processor. On a completely connected network, this operation can be performed in (ts +twm)(p1) time. However, the best communication time for one-toall broadcast is (ts + twm) log p (the same as in the case of a hypercube) if an entire message is routed along the same path.