Efficient way of finding max in 1d array using pthreads in C

I want to find the maximum value in 1d array using pthreads in C.

I have a code like this:

void* findmax(void* arg){
  double temp_max;
  astruct *td=(astruct *)arg;

  temp_max= fabs(P[td->idx]-P_old[td->idx]);


  //give to each thread an element of P 
  /* when the above threads are done give them new element and start the
   loop again till the end of array P */


So the problem is that the mutexes are necessary to find the correct result, but they slow the program so much that in the end the serial code is faster than this implementation.

Is there any efficient way of solving this problem using pthreads that is faster than the serial simple code of finding max?


Use the divide and conquer approach.

  1. Start with an array A of length N. A(i) is the i'th element of the array A. A(i,j) is the subset of A that is the i'th through (j-1)'th elements.
  2. Divide the number N by the number of cores available,C, on the machine. This number is W, the workload size
  3. Define a function maxOnSubset(i,j) that returns a value that is the same type as the elements of A. The function finds the maximum value in A(i,j). If j is greater than the length of A, the function sets j to the length of A.
  4. Start C threads numbered [0,C). The number associated with each thread is c. Each thread is responsible for calling the function maxOnSubset(c*W,(c+1)*W) and storing the value. You can use a semaphore to know when each thread has computed this value. This allows each thread to progress independently of any other thread.
  5. Wait for each thread to complete and collect the stored values in a second array B. The array B has a length of C.
  6. Find the maximum value in B. The maximum value of B is also the maximum value of A.

Need Your Help

Location tracking in background while onChanging of the location in Android

android location locationmanager locationlistener

I am developing android application using the Location. I am able to get the current location using following code.