Prev: Inscribed triangles
Next: JSH: Morphic non-linear Factoring Random solved
From: Pubkeybreaker on 7 May 2010 09:28
Join NFS(a)Home! Help finish the Cunningham project, the longest
ongoing computational project in history.
From: Gerry Myerson on 9 May 2010 23:53
In article
<23ec9c50-c0ed-4f38-a722-de91e30247fd(a)j33g2000yqn.googlegroups.com>,
Pubkeybreaker <pubkeybreaker(a)aol.com> wrote:

> Join NFS(a)Home! Help finish the Cunningham project, the longest
> ongoing computational project in history.

When you want people to join something,
it's traditional to tell them how.

--
Gerry Myerson (gerry(a)maths.mq.edi.ai) (i -> u for email)
From: Noob on 10 May 2010 03:43
Gerry Myerson wrote:

> Pubkeybreaker wrote:
>
>> Join NFS(a)Home! Help finish the Cunningham project, the longest
>> ongoing computational project in history.
>
> When you want people to join something, it's traditional to tell them how.

The project description on Wikipedia
http://en.wikipedia.org/wiki/NFS(a)Home

The official website
http://escatter11.fullerton.edu/nfs/

Regards.
From: Mok-Kong Shen on 10 May 2010 04:51
Noob wrote:
> Gerry Myerson wrote:
>
>> Pubkeybreaker wrote:
>>
>>> Join NFS(a)Home! Help finish the Cunningham project, the longest
>>> ongoing computational project in history.
>>
>> When you want people to join something, it's traditional to tell them
>> how.
>
> The project description on Wikipedia
> http://en.wikipedia.org/wiki/NFS(a)Home
>
> The official website
> http://escatter11.fullerton.edu/nfs/

As I remarked in sci.crypt in a thread (initiated 05.04) of the same
title, there are practical issues (no software to tightly control
the CPU consumption and necessity of constant connection with the
server) that likely renders a participation unattractive for many
people with computers running OS like Windows.

M. K. Shen
From: Pubkeybreaker on 12 May 2010 08:30
On Apr 6, 5:58 am, Mok-Kong Shen <mok-kong.s...(a)t-online.de> wrote:
> Pubkeybreaker wrote:
> > Check outNFS(a)Home;   help them push towards larger numbers.
>
> >http://escatter11.fullerton.edu/nfs/
>
> I wouldn't refute being called a selfish person, but I think
> I would like to take part in some internet collective scientific
> computing projects, if the following conditions could be satisfied
> (I don't know much about the actual working conditions of such
> projects, so part below may be irrelevant):
>
> 1. One can dynamically set an upper limit of the CPU load of the
> process.
>
> 2. One can download on one's initiative the task to be done. During
> the actual processing there is no need of an internet connection to
> the server of the project. One need not have one's computer on 24 hours
> a day, i.e. the process can be interrupted and resumed at any time. One
> uploads the result oneself, when the task processing comes to an end.
>
> M. K. Shen

BOINC already allows you to do this. The current NFS(a)Home project
supports
the features you ask for.
 |  Next  |  Last
Pages: 1 2 3
Prev: Inscribed triangles
Next: JSH: Morphic non-linear Factoring Random solved