[BACK]Return to homogeneous-network.tex CVS log [TXT][DIR] Up to [local] / OpenXM / doc / issac2000

Diff for /OpenXM/doc/issac2000/homogeneous-network.tex between version 1.9 and 1.10

version 1.9, 2000/01/17 01:33:19 version 1.10, 2000/01/17 07:06:53
Line 1 
Line 1 
 % $OpenXM: OpenXM/doc/issac2000/homogeneous-network.tex,v 1.8 2000/01/16 03:15:49 noro Exp $  % $OpenXM: OpenXM/doc/issac2000/homogeneous-network.tex,v 1.9 2000/01/17 01:33:19 noro Exp $
   
 \subsection{Distributed computation with homogeneous servers}  \subsection{Distributed computation with homogeneous servers}
 \label{section:homog}  \label{section:homog}
Line 54  the computational cost and the communication cost for 
Line 54  the computational cost and the communication cost for 
 Figure \ref{speedup} shows that  Figure \ref{speedup} shows that
 the speedup is satisfactory if the degree is large and $L$  the speedup is satisfactory if the degree is large and $L$
 is not large, say, up to 10 under the above envionment.  is not large, say, up to 10 under the above envionment.
 If OpenXM provides the broadcast and the reduce operations, the cost of  If OpenXM provides operations for the broadcast and the reduction
   such as {\tt MPI\_Bcast} and {\tt MPI\_Reduce} respectively, the cost of
 sending $f_1$, $f_2$ and gathering $F_j$ may be reduced to $O(log_2L)$  sending $f_1$, $f_2$ and gathering $F_j$ may be reduced to $O(log_2L)$
 and we can expect better results in such a case.  and we can expect better results in such a case.
   
Legend:
Removed from v.1.9  
changed lines
  Added in v.1.10
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>