Newsgroups: comp.parallel.pvm
From: zmc@quanta.dcrt.nih.gov (Zhuo-Min(jimmy) Chen)
Subject: PVM Broadcast Communications?
Organization: Texas Center for Advanced Molecular Computation
Date: Thu, 2 Nov 1995 15:48:46 GMT
Message-ID: <1995Nov2.154846.23684@alw.nih.gov>

To avoid network saturation, either use relay or Log2P algorithm
one-to-all point communication could easily fill buffers.
1) relay
    Master -> Node 1
              Node 1 -> Node 2
                        Node 2 -> Node 3 ... (slow algorithm)
2) Log2 P
    Master -> Node 1
           
           -> Node 2


              Node 1 -> Node 3
                    ->  Node 4
              Node 2 - > Node 5
                    -> Node 6       

   Waiting level is Log2P
In fact  Log b P   b is base number b >=2 , b can be chossen as big as
 possible before saturation

3) HyperCube Algorithm
               P ^{1/3}
       

