next up previous
Next: この文書について...

\fbox{\large \color{blue} Efficient Computation with OpenXM}

Real speedup by parallelism

Each process can communicate with any other process on MPI

$\Rightarrow$ Collective operations similar to
MPI_Bcast and MPI_Reduce

An example : the product of dense univariate polynomials with 3000bit coefficients

Algorithm(Shoup) : FFT+Chinese Remainder Communication cost :
     $O(n{\color{red} \log L})$ with collective operations
     $O(n{\color{red} L})$ without collective operations
    (L: number of processes, n: degree)

=17cm \epsffile{3k.ps}

http://www.openxm.org

 
Nobuki Takayama 平成13年3月7日