18BCE2182 MIDTERM QUES-2, C (gcc)

18BCE2182 MIDTERM QUES-2

//gcc 7.4.0

#include  <stdio.h>
#include <stdlib.h>
#include <omp.h>
#define N 4096
int main(int argc, char *argv)
{
    int i;
    int arr[N];
    for(i = 0; i < N; i++)//initialising with random values
    {
        arr[i] = rand()%1000;//modulus by 1000 so the numbers dont end up being too big by random
    }
    double start = omp_get_wtime();
    #pragma omp parallel
    {
        #pragma omp sections
        {
            #pragma omp section
            {
                inclusive(arr);
            }
            #pragma omp section
            {
                exclusive(arr);
            }
        }
    }
    double end = omp_get_wtime();
    printf("Time taken parallely %lf\n", end-start );
    return 0;
}
void inclusive(int A[])
{
    int B[N];
    int j, k;
    for(j=0; j<N; j++)
    {
        if(j==0)
        {
            B[0] = A[0];
        }
        else
        {
            for(k=0; k<=j; k++)
            {
                B[j] = B[j]+A[k];
            }
        }
    }
    printf("\n INCLUSIVE PAIR:\n");
    for(j=0; j<N; j++)
    {
        printf(" %d\t ",B[j]);
    }
    printf("\n\n");
}
void exclusive(int A[])
{
    int B[N];
    int j, k;
    for(j=0; j<N; j++)
    {
        if(j==0)
        {
            B[0] = 0;
        }
        else
        {
            for(k=0; k<j; k++)
            {
                B[j] = B[j]+A[k];
            }
        }
    }
    printf("\n EXCLUSIVE PAIR:\n");
    for(j=0; j<N; j++)
    {
        printf(" %d\t ",B[j]);
    }
    printf("\n\n");
}


run \| edit \| history \| help	0

λ

                                      .NET NoSQL database for rapid development