157
Comment:
|
888
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
Describe msri07/anlist here. | = Problem: Implementation in SAGE parallel computation of elliptic curve a_p for all p up to some bound = |
Line 3: | Line 3: |
= Problem: | In the abstract the problem of point counting modulo p, for lots of different p, is an "embarassingly parallelize -- just do each p separately. The challenge here is *not* coming up with an algorithm, but figuring out how to implement something very efficient in SAGE that uses the PARI C library. In other words, you should make this session below run nearly n times as fast, on a machine with n cores: {{{ sage: E = EllipticCurve('37a') sage: time v=E.anlist(10^6, pari_ints=True) CPU times: user 3.05 s, sys: 0.07 s, total: 3.11 s Wall time: 3.17 }}} |
Line 5: | Line 11: |
'''Challenge''': On sage.math.washington.edu, compute all $a_p$ for p < 10^6 in 0.2 seconds wall time. |
Problem: Implementation in SAGE parallel computation of elliptic curve a_p for all p up to some bound
In the abstract the problem of point counting modulo p, for lots of different p, is an "embarassingly parallelize -- just do each p separately. The challenge here is *not* coming up with an algorithm, but figuring out how to implement something very efficient in SAGE that uses the PARI C library. In other words, you should make this session below run nearly n times as fast, on a machine with n cores:
sage: E = EllipticCurve('37a') sage: time v=E.anlist(10^6, pari_ints=True) CPU times: user 3.05 s, sys: 0.07 s, total: 3.11 s Wall time: 3.17
Challenge: On sage.math.washington.edu, compute all a_p for p < 10^6 in 0.2 seconds wall time.
See [:msri07/threadsafety: Thread Safety of the SAGE Libraries] for information about PARI thread safety.