Question

int run_me(unsigned long prime, unsigned long max, int *ary) {
  unsigned long i;
  printf("\nI am %d", prime);

  if(prime > sqrt(max)) {
    return 1; /* do no run */
  }

  for(i = 3; i*prime < max; i+=2) {
    ary[i*prime - 1] = 1;
  }

  return 0;
}

typedef struct Args {
  unsigned long max, prime;
  int *ary;
} args;

void *thread_runner(void *all_args) {
  args *my_args = all_args;
  run_me(my_args->prime, my_args->max, my_args->ary);
  return 0;
}

unsigned long *sieve_of_eratosthenes(unsigned long begin, unsigned long end) {
  unsigned long i, j, arylen, *ary_to_ret;
  unsigned long current_primes[4] = {3, 5, 7, 11}; /* holds primes being used by threads*/
  int *ary_of_all;
  pthread_t threads[4];
  args *curr;

  curr = malloc(sizeof(args));

  ary_of_all = calloc(end, sizeof(int));
  arylen = end - begin + 2;
  ary_to_ret = calloc(arylen, sizeof(unsigned long));
  ary_of_all[0] = 1;

  /*mark all even numbers*/
  for(i = 1; 2 * i < end; i++) {
    ary_of_all[2*i - 1] = 1;
  }

  while(current_primes[3] < sqrt(end)) {
      /*run threads with current primes*/
    for(i = 0; i < 4; i++) {
      curr->prime = current_primes[i];
      curr->max = end;
      curr->ary = ary_of_all;
      pthread_create(&threads[i], NULL, thread_runner, curr);
    }
    /* join all threads */
    for(i = 0; i < 4; i++) {
      pthread_join(threads[i], NULL);
    }

    j = 0; /* number of primes found */

    /*find new primes*/
    for(i = current_primes[3] + 2; i < end && j < 4; i+=2) {
      if(ary_of_all[i - 1] == 0) {
        current_primes[j] = i;
        j++;
      }
    }

  }

  /*run threads one more time*/
  if(current_primes[0] <= sqrt(end)) {
    for(i = 0; i < 4; i++) {
      curr->prime = current_primes[i];
      curr->max = end;
      curr->ary = ary_of_all;
      pthread_create(&threads[i], NULL, thread_runner, curr);
    }
    /* join all threads */
    for(i = 0; i < 4; i++) {
      pthread_join(threads[i], NULL);
    }
  }

  /*create the array to be returned*/
  j = 0; /*pos in *ary_to_ret*/
  for(i = begin; i <= end; i++) {
    if(ary_of_all[i-1] == 0) {
      ary_to_ret[j] = i;
      j++;
    }

  }

  ary_to_ret[j] = 0; /* null terminate */
  ary_to_ret = realloc(ary_to_ret, (j+1) * sizeof(unsigned long));
  return ary_to_ret;
}

我正在运行上面的代码，以便使用Sierat of Eratosthenes得到一个给出高值和低值的素数列表。我的代码大部分都在工作，但是当我运行这段代码时，我使用curr_primes数组中的第一个元素创建的线程从不使用，而是运行5,7,11,11。每次运行数组时都会这样做并重新填充它。我想知道是否有人可以向我解释为什么它以这种方式运行。

Answer 1

您正在将相同的 curr 指针传递给所有线程。你很幸运，它甚至可以像你观察到的那样运作，因为这是一个巨大的竞争条件。相反，代码需要将单独的arg缓冲区传递给每个线程。这是一个例子：

/* doesn't really need to be dynamic memory in this simple example */
args curr[4];

for(i = 0; i < 4; i++) {
  curr[i].prime = current_primes[i];
  curr[i].max = end;
  curr[i].ary = ary_of_all;
  pthread_create(&threads[i], NULL, thread_runner, &curr[i]);
}

/* join all threads */
for(i = 0; i < 4; i++) {
  pthread_join(threads[i], NULL);
}

第一个线程没有运行给定的参数

1 个答案: