version 1.11, 2000/01/17 07:15:52 |
version 1.12, 2000/01/17 08:06:15 |
|
|
% $OpenXM: OpenXM/doc/issac2000/homogeneous-network.tex,v 1.10 2000/01/17 07:06:53 noro Exp $ |
% $OpenXM: OpenXM/doc/issac2000/homogeneous-network.tex,v 1.11 2000/01/17 07:15:52 noro Exp $ |
|
|
\subsection{Distributed computation with homogeneous servers} |
\subsection{Distributed computation with homogeneous servers} |
\label{section:homog} |
\label{section:homog} |
Line 53 the speedup factor depends on the ratio of |
|
Line 53 the speedup factor depends on the ratio of |
|
the computational cost and the communication cost for each unit operation. |
the computational cost and the communication cost for each unit operation. |
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 environment. |
If OpenXM provides operations for the broadcast and the reduction |
If OpenXM provides operations for the broadcast and the reduction |
such as {\tt MPI\_Bcast} and {\tt MPI\_Reduce} respectively, the cost of |
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)$ |