Index of /g_w_reynolds/AP26

      Name                    Last modified       Size  Description


[DIR] Parent Directory        29-Sep-2009 18:54      -  
[   ] AP26-boinc-bin-02Mar..> 01-Mar-2009 18:11   295k  
[   ] AP26-boinc-bin-28Jan..> 26-Feb-2009 12:46   261k  
[   ] AP26-boinc-bin-30Dec..> 26-Feb-2009 12:46   251k  
[   ] AP26-boinc-src-02Mar..> 01-Mar-2009 18:11    39k  
[   ] AP26-boinc-src-28Jan..> 26-Feb-2009 12:46    27k  
[   ] AP26-boinc-src-30Dec..> 26-Feb-2009 12:46    20k  
[TXT] BUGS.txt                01-Mar-2009 18:14     1k  
[TXT] CHANGES.txt             01-Mar-2009 18:11     3k  
[TXT] MD5SUM.txt              01-Mar-2009 18:12     1k  
[   ] PrimeQ_gen.zip          04-Aug-2009 19:16     2k  

This directory contains my attempt to produce a BOINC application from
Jaroslaw Wroblewski's sample implementation of his algorithm for finding a
record length-26 arithmetic progression of primes (AP26). The goal is to
enable PrimeGrid to perform an efficient distributed search.

See AP26-boinc.c for compilation instructions. To compile this code you will
also need

  http://www.math.uni.wroc.pl/~jwr/AP26/AP26.zip for the sample
  implementation source code.

  http://www.math.uni.wroc.pl/~jwr/AP26/faster32.zip for a patch to
  dramatically improve performance on 32-bit machines.

  http://www.math.uni.wroc.pl/~jwr/AP26/AP26v3.pdf for information
  about how the algorithm works and for the copyleft notice.

To compile as a BOINC application (optional) you will also need the BOINC
development library. Source is available (via SVN) at

  http://boinc.berkeley.edu/

To compile for an architecture other than x86/x86_64/ppc64 you will either
need to implement the PrimeQ() function for your CPU, or else install the
GMP library available at

  http://swox.com/gmp/


Initially I intend to concentrate on producing a reliable, BOINC-friendly
application that runs on x86/x86_64 machines under Linux/Windows, with only
the minimum of changes to the SearchAP26() function containing the existing
implementation of the algorithm.

Hopefully this will allow others to work independently on optimising the
algorithm and then easily incorporate their work into the BOINC application.
For those who would rather work directly with the original unmodified
source, you are welcome to send me any improvements to that and I will
incorperate them into this modified source.


Geoffrey Reynolds.