User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2009-05-26, 01:09 #1 Shaopu Lin     Jul 2004 1100002 Posts CADO NFS The cado nfs suite is now available from http://cado.gforge.inria.fr.
2009-05-26, 17:56   #2
Jeff Gilchrist

Jun 2003

22218 Posts

Quote:
 Originally Posted by Shaopu Lin The cado nfs suite is now available from http://cado.gforge.inria.fr.
Anyone have success building this? I keep getting errors during the build process. Seems quite complex with pthreads and MPI versions available.

 2009-05-26, 18:52 #3 CRGreathouse     Aug 2006 22·1,493 Posts Heh, I can't even set up my networking for it properly, let alone build it.
 2009-05-26, 19:13 #4 10metreh     Nov 2008 2×33×43 Posts How fast is it actually meant to be?
 2009-05-26, 20:24 #5 KriZp     Feb 2007 33·5 Posts It built fine for me by just typing "make" (it downloaded CMAKE and built it first), and after I got the ssh-agent working it ran fine on localhost, factoring the c59 example provided. I have been unable to figure out how to make use of remote hosts, the syntax of the mach_desc file is not explained anywhere.
 2009-05-26, 23:39 #6 KriZp     Feb 2007 33×5 Posts It was simply a matter of putting the executables on the remote host and editing the machine description part of the run_example.sh script to include the lines Code: [remote] tmpdir=\$t/tmp cadodir=/path/to/build/directory/ remote_host_name cores=1 It then used 1 remote and 1 local core for polyselect, 2 local and 1 remote core for the sieving, and 1 local for the rest.
 2009-05-27, 00:04 #7 frmky     Jul 2003 So Cal 81416 Posts CADO NFS Moving the discussion of CADO NFS out of the Links thread... I've downloaded the source, compiled it using pthreads, and have successfully ran a GNFS factorization using the included perl script. I have also noticed that the poly file format and relation format matches that of GGNFS. (Thanks for that!) I have not yet figured out how (1) given a polynomial file, do a complete SNFS run, and (2) given a polynomial file and set of relations that possibly includes duplicates and bad relations, do all post-processing steps. Any guidance? Once I know how to do (2), I will determine how well bwc runs on our workstation with up to 32 threads, and on our beowulf cluster of 10x4 cores. Last fiddled with by akruppa on 2009-05-27 at 00:13 Reason: Note: posts moved
2009-05-27, 00:26   #8
akruppa

"Nancy"
Aug 2002
Alexandria

2,467 Posts

Quote:
 Originally Posted by 10metreh How fast is it actually meant to be?
The siever can't compete with Franke/Kleinjung's siever yet. It's slower and uses much more memory. The core sieving routines need a complete overhaul. Embarrassingly, it sieves special-q only on the algebraic side so far.

Quote:
 Originally Posted by frmky I have not yet figured out how (1) given a polynomial file, do a complete SNFS run, and (2) given a polynomial file and set of relations that possibly includes duplicates and bad relations, do all post-processing steps. Any guidance?
The perl script keeps track of which tasks are already done by <prefix>.<task>_done files, so you can write your own poly file and "touch <prefix>.polysel_done" (e.g., "touch 797161_29.polysel_done"). The perl script should generate the factor base and start sieving. If you already have relations, you should be able to copy your own files (matching the naming scheme of the perl script, e.g., "797161_29.rels.9000000-9100000") and simply run the perl script again. It should check the relation files, count how many relations there are, start sievers, and if there are enough relations, try a filtering run. Warning: a file that contains bad relations is deleted. In fact, the script is a bit over-eager "cleaning up" sometimes, keep backups!

More tomorrow,

Alex

2009-05-27, 11:04   #9
R.D. Silverman

Nov 2003

22×5×373 Posts

Quote:
 Originally Posted by akruppa The siever can't compete with Franke/Kleinjung's siever yet. It's slower and uses much more memory. The core sieving routines need a complete overhaul. Embarrassingly, it sieves special-q only on the algebraic side so far. The perl script keeps track of which tasks are already done by ._done files, so you can write your own poly file and "touch .polysel_done" (e.g., "touch 797161_29.polysel_done"). The perl script should generate the factor base and start sieving. If you already have relations, you should be able to copy your own files (matching the naming scheme of the perl script, e.g., "797161_29.rels.9000000-9100000") and simply run the perl script again. It should check the relation files, count how many relations there are, start sievers, and if there are enough relations, try a filtering run. Warning: a file that contains bad relations is deleted. In fact, the script is a bit over-eager "cleaning up" sometimes, keep backups! More tomorrow, Alex
Is this a posix archive? The version of tar that I have will not read --posix
archives.

Indeed, after I gunzipped the file, neither tar -x not tar -t works on the
file; tar just sits there and does nothing.

 2009-05-27, 11:29 #10 akruppa     "Nancy" Aug 2002 Alexandria 2,467 Posts I think it's a GNU tar archive... what version of tar are you using? Is a GNU version of tar installed somewhere, maybe named "gtar" ? Alex
2009-05-27, 11:42   #11
R.D. Silverman

Nov 2003

22·5·373 Posts

Quote:
 Originally Posted by akruppa I think it's a GNU tar archive... what version of tar are you using? Is a GNU version of tar installed somewhere, maybe named "gtar" ? Alex

It is GNU tar 1.12

 Similar Threads Thread Thread Starter Forum Replies Last Post jux CADO-NFS 22 2019-11-12 12:08 henryzz CADO-NFS 4 2017-11-20 15:14 akruppa Programming 22 2015-12-31 08:37 skan Information & Answers 1 2013-10-22 07:00 R.D. Silverman Factoring 4 2008-11-06 12:35

All times are UTC. The time now is 22:37.

Sun Feb 28 22:37:19 UTC 2021 up 87 days, 18:48, 0 users, load averages: 1.97, 1.59, 1.49
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.25792229175567627, "perplexity": 8253.199003470014}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-10/segments/1614178361776.13/warc/CC-MAIN-20210228205741-20210228235741-00399.warc.gz"}