12 lines
333 B
Plaintext
12 lines
333 B
Plaintext
|
Excercise 1
|
||
|
|
This is our quick tutorial.
|
||
|
|
|
||
|
|
|
||
|
|
Excercise 2
|
||
|
|
Implement in OpenMP the search of the maximum value in an array with randomly generated numbers. Check the speed up from 1 up to X threads.
|
||
|
|
|
||
|
|
Why there is no speed up at some point?
|
||
|
|
|
||
|
|
|
||
|
|
Excercise 3
|
||
|
|
Implement bubble sort in OpenMP. Can you make it faster than 1 threaded quicksort?
|