It's UWAweek 47

help5507

This forum is provided to promote discussion amongst students enrolled in CITS5507 High Performance Computing.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Displaying selected article
Showing 1 of 148 articles.
Currently 25 other people reading this forum.


 UWA week 34 (2nd semester, week 5) ↓
SVG not supported

Login to reply

👍?
helpful
6:48pm Fri 23rd Aug, ANONYMOUS

#include <stdio.h> #include <stdlib.h> #include <string.h> #include <time.h> #include <unistd.h> #include <omp.h> #define ARRAY_LEN 1000000 int main(int argc, char* argv[]) { unsigned int seed = 12345; srand(seed); int arr[ARRAY_LEN]; for(int i=0;i<ARRAY_LEN;++i){ arr[i] = rand(); } int realTotalSum = 0; for(int i=0;i<ARRAY_LEN;++i){ realTotalSum += arr[i]; } clock_t start = clock(); const int n = 128; omp_set_num_threads(n); printf("OpenMP running with %d threads\n", omp_get_max_threads()); int localSums[128] = {0}; int localSum = 0; long i = 0; #pragma omp parallel private(localSum) { int id = omp_get_thread_num(); printf("Hello world from thread %d\n", id); #pragma omp for for(long i = 0; i < ARRAY_LEN; ++i){ localSum += arr[i]; } localSums[id] = localSum; printf("local sum in thread: %d\n", localSum); } int totalSum = 0; for(int i = 0;i<n;++i){ totalSum += localSums[i]; } printf("realTotalSum:%d\n", realTotalSum); printf("totalSum:%d\n", totalSum); clock_t end = clock(); double timeSpent = (double)(end - start) / CLOCKS_PER_SEC; printf("time spent = %10.6f\n", timeSpent); return 0; } //This is my code, I just change the const int n = 128 to others for test.

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  8:08AM Aug 25 2024
Privacy policy