Preparing for v0.4
I'm going to be learning OpenCL, after which I will decide whether to use OpenCL or OpenMP for the development of Indivisible. This mostly depends on the compatibility of each library with GMP, especially since I believe GMP already does some of its own threading.
This commit is contained in:
parent
06cb271dba
commit
2e9326b5fb
@ -16,3 +16,5 @@ Change Log
|
|||||||
- Algorithm skips half the known primes.
|
- Algorithm skips half the known primes.
|
||||||
- Removed `likely()' and `unlikely()' macros due to lack of information.
|
- Removed `likely()' and `unlikely()' macros due to lack of information.
|
||||||
- Improved performance.
|
- Improved performance.
|
||||||
|
- v0.4: Parallel Computations
|
||||||
|
- Implemented Parallel computing of prime numbers.
|
||||||
|
@ -11,7 +11,7 @@ static bool run;
|
|||||||
void leave();
|
void leave();
|
||||||
|
|
||||||
int main(void) {
|
int main(void) {
|
||||||
puts("Indivisible v0.3\n");
|
puts("Indivisible v0.4\n");
|
||||||
|
|
||||||
// Quit on ^C by setting `run = false'
|
// Quit on ^C by setting `run = false'
|
||||||
run = true;
|
run = true;
|
||||||
|
Loading…
Reference in New Issue
Block a user