CMPT-585 Project Presentation

Ayesha Mohiuddin Ramazan Burus

Generating Prime Numbers using Grid Computing

Prime Numbers

Used in cryptographic algorithms: e.g. RSA algorithm, PKE, PKI, Diffie-Helman key exchange

GIMPS; Great Internet Mersenne Prime Search: A Mersenne prime is a prime of the form 2P-1.

On May 15, 2004, Josh Findley discovered the 41st known Mersenne Prime, 224,036,583-1. The number is nearly 7 million digits large. Josh's calculation took just over two weeks on his 2.4 GHz Pentium 4 computer.

Project Details:

Programming language used: JAVA

Database: ORACLE

Object: Having a grid of multiple clients calculate prime numbers between unique ranges of numbers, to obtain a large list of prime numbers.

Oracle Database

Master Client 1

Client 2

Client 3

Grid Architecture

Grid Structure

ClientAllotted a unique Id and time limitGets the range of numbers to calculate

MasterKeeps monitoring the activityRe-assigns range to another client if original client does not complete within its allotted time(1 day: for our experiment)

DatabaseStores the client information and the resulted Prime numbers sent by the clients

3 Components:

Number Ranges

As Numbers keep increasing; Prime numbers keep decreasing.

0 2 27

Conclusion

Executable: 1.29 MB Memory usage: 10 MB CPU usage: 7 to 10 Total primes generated by now : 376074 Largest Prime found by now: 6583813

Useful Links:

http://www.mersenne.org

http://www.eskimo.com/~weidai/algorithms.html

http://livinginternet.com/i/is_crypt_pkc_work.htm