Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
18BCE2182 ASSESS_3 Q1
//gcc 7.4.0 #include <stdio.h> #include <omp.h> int main(void) { int i, sum; int arr[7]; for (i = 0; i< 7; i++) { arr[i]=i+9; } #pragma omp parallel for private (sum) for (i = 0; i < 7; i++) { sum = sum + arr[i]; } printf("\nFor private, Sum=%d", sum); #pragma omp parallel for firstprivate (sum) for (i = 0; i < 7; i++) { sum = sum + arr[i]; } printf("\nFor 1st private, Sum=%d", sum); #pragma omp parallel for lastprivate (sum) for (i = 0; i < 7; i++) { sum = sum + arr[i]; } printf("\nFor Last private, Sum=%d", sum); #pragma omp parallel for shared (sum) for (i = 0; i < 7; i++) { sum = sum + arr[i]; } printf("\nFor Shared, Sum=%d", sum); }
run
|
edit
|
history
|
help
0
150116_MatrizOrdenada
2.2 Comparision with Matrix Addition Execution Time
WrongWay reversible iterator Copyright(C) 2016 Henry Kroll III www.thenerdshow.com
A_141121_mayorMenor
ptr[]
Pozdravljeni v mali soli C.
Spring 2017 Project 2 v1
Linked List demo in C
Newtons method
14th Feb Project