Diff for "CUDA" - Sagemath Wiki

Differences between revisions 1 and 3 (spanning 2 versions)

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"

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.

-  ⇤ ← Revision 1 as of 2009-05-17 22:10:06 → 
  Size: 157
  Editor: WilliamHart
  Comment:
+   ← Revision 3 as of 2009-05-17 22:26:25 → ⇥
  Size: 625
  Editor: WilliamHart
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 5:
+You can chat in a Linux text console by installing "irssi" and running: "irssi -c irc.freenode.net" and then type "/join #sage-devel"

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.