Difference between revisions of "GPU610/NullPointerException"
(→Unlisted) |
(→Progress) |
||
| Line 9: | Line 9: | ||
== Progress == | == Progress == | ||
=== Assignment 1 === | === Assignment 1 === | ||
| + | ==[[User:Philip_A_Aziz | Philip Aziz]]:== | ||
| + | |||
* Philip Aziz - Calculating Prime Numbers | * Philip Aziz - Calculating Prime Numbers | ||
| Line 51: | Line 53: | ||
| − | + | ==[[User:Saad_Mohammad| Saad Mohammad]]:== | |
| + | |||
| + | Encrypts and decrypts images. | ||
| + | ORIGINAL PROJECT: [https://github.com/markwatson/Image-Encrypt Image-Encrypt Github] | ||
| − | + | ==[[User:Nmayuranathan | Natesh Mayuranathan]]:== | |
=== Assignment 2 === | === Assignment 2 === | ||
=== Assignment 3 === | === Assignment 3 === | ||
Revision as of 21:14, 6 March 2013
GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary
Contents
NullPointerException
Team Members
Progress
Assignment 1
Philip Aziz:
- Philip Aziz - Calculating Prime Numbers
Only the inner loop would be possible to Parellelize but would still require to validate 1 prime number at a time due to need to validate against previous prime numbers.
while (count < n){
flag = 1;
i = 1;
checkKey = int((sqrt (prime))+1);
//checks prime numbers for divisible values
while(primes[i] < checkKey and flag){
if ((prime % primes[i])==0){
flag = 0;
}
i++;
}
if(flag){
primes[count] = prime;
count++;
}
prime +=2;
}
| n | Elapsed Time |
|---|---|
| 10,000 | 0 |
| 100,000 | 1 |
| 1,000,000 | 8 |
| 10,000,000 | 220 |
| 100,000,000 | 6200 |
Saad Mohammad:
Encrypts and decrypts images. ORIGINAL PROJECT: Image-Encrypt Github
