On Jun 25, 2009, at 12:58 AM, William Stein wrote: > > On Thu, Jun 25, 2009 at 5:53 AM, Robert > Bradshaw<[email protected]> wrote: >> >> On Jun 23, 2009, at 3:09 PM, rje wrote: >> >>> First, thanks to David and William, who have answered my >>> questions in >>> the past. >>> >>> I have access to NVIDIA Tesla and AMD Firestream GPGPU hardware. Are >>> there any existing tools which would help facilitate porting and >>> finely parallelizing the following 3-line Sage program to take >>> advantage of that hardware ? >> >> Not that I know of, but you can look at how the computation is done >> under the hood and write it in a more parallel way. >> >>> sage: G=DirichletGroup(18900, GF(193));X=G.list();Y=X[0]; >>> sage: M=ModularSymbols(Y,4,sign=1); >> >> This probably is dominated by the linear algebra over Q. > > Where Q = GF(193) -- see above.
Doh! I missed that. Parallelizing linear algebra over a finite field field has been studied, but it's much less trivial. The sum can probably still be parallelized. - Robert --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
