Timeline for Fastest way to factor integers < 2^60
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 22, 2012 at 17:59 | comment | added | Igor Rivin | Remember that pari/go also has a library mode, so you can just make calls to it to factor, and do your own memory management. | |
| Nov 22, 2012 at 4:49 | comment | added | Kevin Acres | I have found that pari/gp is always an excellent tool for prototyping and good for research up to a point. Another instance were it 'maxed out' was in this project: listserv.nodak.edu/cgi-bin/… . Here I hand coded the agm functions and achieved much better speeds that pari/gp was able to offer at the time. | |
| Nov 22, 2012 at 4:28 | comment | added | Kevin Acres | @Igor: This is a 32 core machine that I'm coding for, equipped with 32GByte of RAM. Using C I can store 50,000,000 64 bit values into 400MByte RAM, so each one of the 32 processes will still have plenty of RAM left over. Running pari/gp means that I can only reliably run 3 processes, with each one using over 8GBytes. | |
| Nov 22, 2012 at 4:09 | history | answered | Igor Rivin | CC BY-SA 3.0 |