Annotation of OpenXM/doc/calc2000p/efficient.tex, Revision 1.3
1.3 ! noro 1: % $OpenXM: OpenXM/doc/calc2000p/efficient.tex,v 1.2 2000/07/22 08:11:09 noro Exp $
1.1 noro 2: \documentclass{slides}
1.3 ! noro 3: \topmargin -0.5cm
! 4: \textheight 9.5in
1.1 noro 5: \usepackage{color}
1.2 noro 6: \usepackage{rgb}
1.1 noro 7: \usepackage{graphicx}
8: \usepackage{epsfig}
9: \begin{document}
10: \parskip 3pt
1.3 ! noro 11: \fbox{\large \color{blue} Efficient Computation with OpenXM}
! 12: \vskip 2pt
1.1 noro 13:
1.2 noro 14: {\color {red} Real speedup by parallelism}
1.1 noro 15:
1.2 noro 16: Each process can communicate with any other process on {\color{green} MPI}
1.1 noro 17:
1.2 noro 18: $\Rightarrow$ {\color{green} Collective operations} similar to \\
19: {\color{SeaGreen} MPI\_Bcast} and {\color{SeaGreen} MPI\_Reduce}
1.1 noro 20:
1.2 noro 21: \vskip 8pt
1.1 noro 22:
23: {\color{red} An example} :
1.2 noro 24: the product of dense univariate polynomials with 3000bit coefficients
1.1 noro 25:
1.2 noro 26: \vskip 8pt
27: {\color{green} Algorithm}(Shoup) : FFT+Chinese Remainder
28: \vskip 5pt
1.3 ! noro 29: {\color{green} Communication cost} :\\
! 30: \quad $O(n{\color{red}\log L})$ with collective operations\\
! 31: \quad $O(n{\color{red}L})$ without collective operations\\
! 32: \quad ($L$: number of processes, $n$: degree)
1.1 noro 33:
1.3 ! noro 34: \vskip 5pt
1.1 noro 35:
36: \epsfxsize=17cm
37: \epsffile{3k.ps}
1.3 ! noro 38:
1.2 noro 39: \rightline{ {\color{red} {\tt http://www.openxm.org} }}
1.1 noro 40: \end{document}
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>