APUE 多线程排序

为什么80%的码农都做不了架构师？>>>   

#include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#include <sys/time.h>
#include <limits.h>

#define NTHR (8)
#define NUMNUM 8000000L
#define TNUM (NUMNUM/NTHR)

pthread_barrier_t b;

long nums[NUMNUM];
long snums[NUMNUM];

int complong(const void *arg1, const void *arg2)
{
    long l1 = *(long*)arg1;
    long l2 = *(long*)arg2;

    if (l1 == l2) return 0;
    if (l1 < l2) return -1;
    return 1;

}

void* thr_fn(void *arg)
{
    long idx = (long)arg;
    qsort(&nums[idx], TNUM, sizeof(long), complong);
    pthread_barrier_wait(&b);
    return ((void *)0);
}

void merge()
{
    long idx[NTHR];
    long i, minidx, sidx, num;

    for (i = 0; i < NTHR; i++) 
        idx[i] = i *TNUM;

    for (sidx = 0; sidx < NUMNUM; sidx++) {
        num = LONG_MAX;
        for (i = 0; i < NTHR; i++) {
            if ((idx[i] < (i+1) * TNUM) && (nums[idx[i]] < num)) {
                num = nums[idx[i]];
                minidx = i;
            }
        }

        snums[sidx] = nums[idx[minidx]];
        idx[minidx]++;
    }
}

int main(int argc, char *argv[])
{
    unsigned long i;
    struct timeval start, end;
    long long startuser, endusec;
    double elapsed;
    int err;
    pthread_t tid;

    srandom(1);
    for (i = 0; i < NUMNUM; i++) {
        nums[i] = random();
    }

    gettimeofday(&start, NULL);
    pthread_barrier_init(&b, NULL, NTHR + 1);

    for (i = 0; i < NTHR; i++) {
        err = pthread_create(&tid, NULL, thr_fn, (void *)(i * TNUM));
        if (err != 0) {
            perror("can't create thread!");
        }
    }
    pthread_barrier_wait(&b);
    merge();
    gettimeofday(&end, NULL);

    startuser = start.tv_sec * 1000000 + start.tv_usec;
    endusec = end.tv_sec * 1000000 + end.tv_usec;
    elapsed = (double)(endusec - startuser) / 1000000.0;

    printf("sort took %.4f seconds\n", elapsed);
#if 0
    for (i = 0; i < NUMNUM; i++) {
        printf("%d ", nums[i]);
    }
#endif

    exit(0);

}

 

转载于:https://my.oschina.net/tsh/blog/1498616