| 1 |
A WWW Based Computing Project Undertaken at NPAC - RSA Factoring
|
| 2 |
How It All Fits Together
|
| 3 |
The FAFNER servers are hierarchical; there is a root server, plus several major subservers. Each of these in turn has subservers, and so forth.
|
| 4 |
A FAFNER subserver depends on its parent for sieving tasks. As they pass from server to server, they are broken up into smaller and smaller bites. By the time they get to clients, there may be as few as 100 Q-values per task.
|
| 5 |
The sieving clients (GNFS or GNFSD processes) are the leaves of the FAFNER tree; they get a single task from a FAFNER server, and then spend anywhere from 15 minutes to several days computing the problem.
|
