Description
Beal's Conjecture states that if Ax + By = Cz for integers A,B,C > 0 and integers x,y,z > 2, then A, B, and C must share a common prime factor. Norvig and others have shown that the conjecture holds for A,B,C,x,y,z < 1000, but the truth of the general conjecture remains unresolved. Extending the search for counterexamples to significantly greater values of the conjecture's six integer parameters is a task ideally suited to the use of an SIMD parallel algorithm implemented on a GPGPU platform. In 2009, J. Chauhan (SDSU) developed such an algorithm, implemented in the C programming language with CUDA extensions for execution on the NVIDIA GeForce 8400GS GPGPU. In the concluding remarks of his thesis Chauhan suggested that future researches might extend the practical search range for his algorithm by implementing it as a distributed application across multiple GPGPUs. This thesis project is one of a pair of related thesis projects aimed at developing a heterogeneous NPACI-Rocks/MPI/CUDA distributed multi-GPGPU application for seeking counterexamples to Beal's Conjecture. In particular, this thesis project comprised the development and testing of NPACI-Rocks/CUDA installation and integration procedures for the application on a commodity cluster host with NVIDIA Ge Force 8400GS GPGPU-enabled computer nodes.
