Youtube Video Link: https://www.youtube.com/watch?v=Wg8UzDGd_WI&feature=youtu.be
- Teammate 1: Aashish Thyagarajan
- Teammate 2: Harman Preet Singh
- Teammate 3: Vipul Sharma
Generating higher order prime numbers utilizing GPU cluster(s).
-
A working kernel implementation to calculate prime numbers over multiple GPUs with focus on accuracy and correctness (we would need the access to the Discovery Lab for the GPU cluster).
-
We will be using the Sieve of Eratosthenes for the prime number calculation.
-
Our focus will be on performance optimization of generating prime numbers.
-
We will try to push the upper limit on calculating higher order prime numbers.
We will need to use:
- C
- CUDA API
- Discovery Lab cluster (multiple GPUs)
- Go through the cited publication below to get a better understanding of the project.
- Learn about parallel programming with GPUs and CUDA.
- Try and generate small prime numbers in single GPU implementations on our laptops/desktops.
A New High Performance GPU-based Approach to Prime Numbers Generation
- How to implement parallel programming using CUDA.
- Ensuring system stability in a multiple GPU environment.
- Effectively avoiding hardware/kernel implementation bottlenecks.
- Getting Discovery Lab access and utilizing it effectively for our project.