This problem is similar to one to all broadcast in parallel computing. Imagine all the nodes in form of hypercube.
On Wed, Aug 22, 2012 at 2:04 PM, Karthikeyan V.B <[email protected]>wrote: > A network of N computers is such that each computer is connected to > every other.Transferring one byte of information between two computers > takes one unit of time. In the beginning, a file resides on only one > computer on the network. The size of the file is M bytes. Come up with a > strategy to duplicate this file across all N machines {that is each machine > should have a local copy of the file} in minimum amount of time. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- .................................... *Regards *Ravi Maggon Member Technical - IT/Front Office D.E. Shaw & Co. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
