mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > CADO-NFS

Reply
 
Thread Tools
Old 2020-08-11, 13:01   #23
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

67118 Posts
Default

The filtering does take a ton of memory and a previous CADO paper showed how to split the merge phase across many threads of a single machine; per the report the filtering machine had 1.5TB of memory.

The other high memory step is the middle part of block Wiedemann, and the more clusters you split the LA across the more memory that middle part uses.

The square root does not need high memory if you use Montgomery's very complex square root algorithm, or you can throw memory at the problem and use the much simpler algorithm that CADO-NFS does.
jasonp is offline   Reply With Quote
Old 2020-08-11, 15:01   #24
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

131278 Posts
Default

Assuming that it isn't for huge time periods, 1.5TB isn't unthinkable for a university to have access to in one machine. I had access to 1TB at once for a while based off Ivy Bridge hardware. It will be easier/cheaper now than that.
henryzz is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
factored mp / (mp < 100.000.000 ) bhelmes Data 3 2018-09-28 18:31
10^224 + 3 factored 2147483647 Factoring 0 2016-12-31 16:22
Factored vs. Completely factored aketilander Factoring 4 2012-08-08 18:09
F33 is factored !! Raman Factoring 4 2010-04-01 13:57
RSA-100 factored! ewmayer Math 5 2003-05-14 15:08

All times are UTC. The time now is 10:32.

Fri Sep 18 10:32:10 UTC 2020 up 8 days, 7:43, 0 users, load averages: 2.11, 1.72, 1.59

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.