Advertisement
Guest User

Untitled

a guest
May 26th, 2019
139
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 2.54 KB | None | 0 0
  1. #include <cuda.h>
  2. #include <curand_kernel.h>
  3. #include <stdio.h>
  4. #include <time.h>
  5. #include<stdio.h>
  6. #include<math.h>
  7. #include<time.h>
  8. #include<stdlib.h>
  9.  
  10. #define N 1
  11. const int n = 3;
  12.  
  13. __global__ void setup_kernel(curandState * state, unsigned long seed)
  14. {
  15.     int id = threadIdx.x;
  16.     curand_init(seed, id, 0, &state[id]);
  17. }
  18.  
  19. __global__ void generate(curandState* globalState, float* randomArray)
  20. {
  21.     int ind = threadIdx.x;
  22.     curandState localState = globalState[ind];
  23.     float RANDOM = curand_uniform(&localState);
  24.     randomArray[ind] = RANDOM;
  25.     globalState[ind] = localState;
  26. }
  27.  
  28. double f(double x[])
  29. {
  30.     return x[0]*x[1]*x[2];
  31. }
  32.  
  33. double r()
  34. {
  35.     dim3 tpb(N, 1, 1);
  36.     curandState* devStates;
  37.     float* randomValues = new float[N];
  38.     float* devRandomValues;
  39.  
  40.     cudaMalloc(&devStates, N * sizeof(curandState));
  41.     cudaMalloc(&devRandomValues, N * sizeof(*randomValues));// setup seeds
  42.     setup_kernel <<< 1, tpb >>> (devStates, time(NULL));
  43.  
  44.     //printf("%s\n", cudaGetErrorString(cudaGetLastError()));// generate random numbers
  45.     generate <<< 1, tpb >> > (devStates, devRandomValues);
  46.  
  47.     //printf("%s\n", cudaGetErrorString(cudaGetLastError()));
  48.  
  49.     cudaMemcpy(randomValues, devRandomValues, N * sizeof(*randomValues), cudaMemcpyDeviceToHost);
  50.  
  51.     cudaFree(devRandomValues);
  52.     cudaFree(devStates);
  53.  
  54.     return randomValues[0];
  55. }
  56.  
  57. void integral(int number_of_points, double m[]) {
  58.     //srand(time(NULL));
  59.  
  60.     int in = 0;
  61.     double k[n + 1];
  62.     for (int i = 0; i < number_of_points; i++)
  63.     {
  64.         for (int i = 0; i < n + 1; i++)
  65.         {
  66.             k[i] = r()*(m[2 * i + 1] - m[2 * i]) + m[2 * i];
  67.         }
  68.  
  69.         if (f(k) < k[n] && k[n] < 0)
  70.         {
  71.             in--;
  72.         }
  73.         if (f(k) > k[n] && k[n] > 0) {
  74.             in++;
  75.         }
  76.     }
  77.  
  78.     double v = 1;
  79.     for (int i = 0; i < n + 1; i++)
  80.     {
  81.         v = v * (m[2 * i + 1] - m[2 * i]);
  82.     }
  83.     double real = 9176.7;
  84.     double result = v*in/number_of_points;
  85.     printf(" result= %lf, error %lf\n ", result, fabs(result - real));
  86. }
  87.  
  88. int main(int argc, char** argv)
  89. {
  90.     //const int n = 3;
  91.     //printf("enter n: \n");
  92.     //scanf("%d", &n);
  93.  
  94.     double m[2 * (n + 1)];
  95.  
  96.     for (int i = 0; i < n; i++)
  97.     {
  98.         printf("enter min x[%d]: \n", i);
  99.         scanf("%lf", &m[2 * i]);
  100.  
  101.         printf("enter max x[%d]: \n", i);
  102.         scanf("%lf", &m[2 * i + 1]);
  103.     }
  104.  
  105.     for (int i = 1; i < 2; i++)
  106.     {
  107.         printf("enter min y: \n");
  108.         scanf("%lf", &m[2 * n]);
  109.  
  110.         printf("enter max y: \n");
  111.         scanf("%lf", &m[2 * n + i]);
  112.     }
  113.  
  114.  
  115.     for (int number_of_points = 100; number_of_points < 1000000000; number_of_points *= 10) {
  116.         printf("For %d points\n", number_of_points);
  117.         integral(number_of_points, m);
  118.     }
  119.  
  120. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement