|
Size: 625
Comment:
|
Size: 1110
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 8: | Line 8: |
| ---- /!\ '''Edit conflict - other version:''' ---- |
|
| Line 13: | Line 15: |
---- /!\ '''Edit conflict - your version:''' ---- Parallel algorithms: * Multimodular algorithms * Scalar algorithms * Peter Montgomery's remainder algorithm a mod b, precompute b1 = B mod b, b2 = B^2 mod b, b3 = B^3 mod b, then write a = a0 + a1*B + a2*B^2 +..., then compute a0 + a1*b1 + a2*b2 +.... and do final reduction mod b. Multiplications can be done in parallel. ---- /!\ '''End of edit conflict''' ---- |
MPIR - Parallel Algorithms and CUDA
Present : Carl Witty, Bill Hart, Michael Abshoff, Glenn Tarbox Virtually Present : Jeff Gilchrist, Gonzalo Tornaria
You can chat in a Linux text console by installing "irssi" and running: "irssi -c irc.freenode.net" and then type "/join #sage-devel"
![/!\](/moin_static1911/modernized/img/alert.png "/!\"){kind=small}
Edit conflict - other version:
Parallel algorithms:
* Multimodular algorithms * Scalar algorithms * Peter Montgomery's remainder algorithm a mod b, precompute b1 = B mod b, b2 = B2 mod b, b3 = B3 mod b, then write a = a0 + a1*B + a2*B^2 +..., then compute a0 + a1*b1 + a2*b2 +.... and do final reduction mod b. Multiplications can be done in parallel.
Edit conflict - your version:
Parallel algorithms:
- Multimodular algorithms
- Scalar algorithms
Peter Montgomery's remainder algorithm a mod b, precompute b1 = B mod b, b2 = B2 mod b, b3 = B3 mod b, then write a = a0 + a1*B + a2*B^2 +..., then compute a0 + a1*b1 + a2*b2 +.... and do final reduction mod b. Multiplications can be done in parallel.
End of edit conflict