Statistiques
| Révision :

root / Pi / C / OpenMP / Pi_OpenMP.c @ 36

Historique | Voir | Annoter | Télécharger (2,32 ko)

1 8 equemene
//
2 8 equemene
// Estimation of Pi using Monte Carlo exploration process
3 8 equemene
// gcc -std=c99 -O3 -o Pi Pi.c -lm
4 8 equemene
//
5 8 equemene
6 8 equemene
#include <math.h>
7 8 equemene
#include <stdio.h>
8 8 equemene
#include <stdlib.h>
9 8 equemene
#include <omp.h>
10 29 equemene
#include <limits.h>
11 8 equemene
12 8 equemene
// Marsaglia RNG very simple implementation
13 8 equemene
#define znew  ((z=36969*(z&65535)+(z>>16))<<16)
14 8 equemene
#define wnew  ((w=18000*(w&65535)+(w>>16))&65535)
15 8 equemene
#define MWC   (znew+wnew)
16 8 equemene
#define SHR3  (jsr=(jsr=(jsr=jsr^(jsr<<17))^(jsr>>13))^(jsr<<5))
17 8 equemene
#define CONG  (jcong=69069*jcong+1234567)
18 8 equemene
#define KISS  ((MWC^CONG)+SHR3)
19 8 equemene
20 8 equemene
#define MWCfp MWC * 2.328306435454494e-10f
21 8 equemene
#define KISSfp KISS * 2.328306435454494e-10f
22 8 equemene
23 8 equemene
#define ITERATIONS 1000000000
24 8 equemene
25 10 equemene
#define PROCESS 4
26 8 equemene
27 8 equemene
#ifdef LONG
28 29 equemene
#define LENGTH long long
29 8 equemene
#else
30 29 equemene
#define LENGTH int
31 8 equemene
#endif
32 8 equemene
33 8 equemene
LENGTH MainLoopGlobal(LENGTH iterations,unsigned int seed_w,unsigned int seed_z)
34 8 equemene
{
35 8 equemene
   unsigned int z=seed_z;
36 8 equemene
   unsigned int w=seed_w;
37 8 equemene
38 8 equemene
   LENGTH total=0;
39 8 equemene
40 8 equemene
   for (LENGTH i=0;i<iterations;i++) {
41 8 equemene
42 8 equemene
      float x=MWCfp ;
43 8 equemene
      float y=MWCfp ;
44 8 equemene
45 8 equemene
      // Matching test
46 8 equemene
      int inside=((x*x+y*y) < 1.0f) ? 1:0;
47 8 equemene
      total+=inside;
48 8 equemene
   }
49 8 equemene
50 8 equemene
   return(total);
51 8 equemene
}
52 8 equemene
53 8 equemene
int main(int argc, char *argv[]) {
54 8 equemene
55 10 equemene
  unsigned int seed_w=10,seed_z=10,process=PROCESS;
56 8 equemene
  LENGTH iterations=ITERATIONS;
57 8 equemene
  LENGTH inside[1024],insides=0;
58 8 equemene
59 8 equemene
  if (argc > 1) {
60 31 equemene
    iterations=(LENGTH)atoll(argv[1]);
61 10 equemene
    process=atoi(argv[2]);
62 8 equemene
  }
63 8 equemene
  else {
64 10 equemene
    printf("\n\tPi : Estimate Pi with Monte Carlo exploration\n\n");
65 10 equemene
    printf("\t\t#1 : number of iterations (default 1 billion)\n");
66 10 equemene
    printf("\t\t#2 : number of process (default 4)\n\n");
67 8 equemene
  }
68 8 equemene
69 29 equemene
  printf ("\n\tInformation about architecture:\n\n");
70 29 equemene
71 29 equemene
  printf ("\tSizeof int = %lld bytes.\n", (long long)sizeof(int));
72 29 equemene
  printf ("\tSizeof long = %lld bytes.\n", (long long)sizeof(long));
73 29 equemene
  printf ("\tSizeof long long = %lld bytes.\n\n", (long long)sizeof(long long));
74 29 equemene
75 29 equemene
  printf ("\tMax int = %u\n", INT_MAX);
76 29 equemene
  printf ("\tMax long = %ld\n", LONG_MAX);
77 29 equemene
  printf ("\tMax long long = %lld\n\n", LLONG_MAX);
78 29 equemene
79 8 equemene
#pragma omp parallel for
80 10 equemene
  for (int i=0 ; i<process; i++) {
81 10 equemene
    inside[i]=MainLoopGlobal(iterations/process,seed_w,seed_z);
82 29 equemene
    printf("\tFound %lld for process %i\n",(long long)inside[i],i);
83 8 equemene
  }
84 10 equemene
  printf("\n");
85 8 equemene
86 10 equemene
  for (int i=0 ; i<process; i++) {
87 8 equemene
    insides+=inside[i];
88 8 equemene
  }
89 8 equemene
90 8 equemene
  float pi=4.*(float)insides/(float)iterations;
91 8 equemene
92 29 equemene
  printf("\tPi=%f with error %f and %lld iterations\n\n",pi,
93 29 equemene
         fabs(pi-4*atan(1))/pi,(long long)iterations);
94 8 equemene
95 8 equemene
}