OpenXM/doc/issac2000/homogeneous-network.tex - diff

Return to homogeneous-network.tex CVS log

Up to [local] / OpenXM / doc / issac2000

version 1.12, 2000/01/17 08:06:15

version 1.13, 2000/01/17 08:50:56

Line 1

% $OpenXM: OpenXM/doc/issac2000/homogeneous-network.tex,v 1.11 2000/01/17 07:15:52 noro Exp $

% $OpenXM: OpenXM/doc/issac2000/homogeneous-network.tex,v 1.12 2000/01/17 08:06:15 noro Exp $

\subsection{Distributed computation with homogeneous servers}

\label{section:homog}

Line 34 Figure \ref{speedup}

shows the speedup factor under the above distributed computation

on Risa/Asir. For each $n$, two polynomials of degree $n$

with 3000bit coefficients are generated and the product is computed.

The machine is Fujitsu AP3000,

The machine is FUJITSU AP3000,

a cluster of Sun connected with a high speed network and MPI over the

a cluster of Sun workstations connected with a high speed network

network is used to implement OpenXM.

and MPI over the network is used to implement OpenXM.

\begin{figure}[htbp]

\epsfxsize=8.5cm

\epsffile{speedup.ps}

Line 56 the speedup is satisfactory if the degree is large and

is not large, say, up to 10 under the above environment.

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.

\subsubsection{Competitive distributed computation by various strategies}