Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
/*
* Fork/Join Framework
*
* Test that the pool keeps processing tasks even in the absence of a call to
* future_get by external threads. (Filters out implementations that do not have
* a correct worker implementation that keeps checking the global queue.)
*
* Written by G. Back for CS3214 Spring 2016.
*/
#include <pthread.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>
#include <stdint.h>
#include <unistd.h>
#include <sys/time.h>
#include <sys/resource.h>
#include <time.h>
#include "threadpool.h"
#include "threadpool_lib.h"
#define DEFAULT_THREADS 2
#define DEFAULT_TASKS 40
struct time_range {
uintptr_t taskno;
struct timeval start;
struct timeval end;
};
static int count;
static void *
test_task(struct thread_pool *pool, struct time_range * data)
{
__sync_fetch_and_add(&count, 1);
return (void *)data->taskno;
}
static int
run_test(int nthreads, int ntasks)
{
struct benchmark_data * bdata = start_benchmark();
struct thread_pool * threadpool = thread_pool_new(nthreads);
struct time_range start_end[ntasks];
struct future * futures[ntasks];
printf("starting %d tasks...\n", ntasks);
count = 0;
for (int i = 0; i < ntasks; i++) {
start_end[i].taskno = i;
futures[i] = thread_pool_submit(threadpool, (fork_join_task_t) test_task, start_end + i);
}
struct timespec sleep_time = {
.tv_sec = 0,
.tv_nsec = 200*1000*1000 // 200 ms should be plenty of time for those tasks to be
// processed.
};
nanosleep(&sleep_time, NULL);
if (count != ntasks) {
fprintf(stderr, "Your pool did not make progress in the absence of calls to future_get\n");
abort();
}
for (int i = 0; i < ntasks; i++) {
uintptr_t r = (uintptr_t) future_get(futures[i]);
// consistency check
if (r != i) {
fprintf(stderr, "Wrong result, expected %d, got %lu\n", i, r);
abort();
}
future_free(futures[i]);
}
thread_pool_shutdown_and_destroy(threadpool);
stop_benchmark(bdata);
report_benchmark_results(bdata);
printf("Test successful.\n");
free(bdata);
return 0;
}
/**********************************************************************************/
static void
usage(char *av0, int exvalue)
{
fprintf(stderr, "Usage: %s [-n <n>] [-t <t>]\n"
" -n number of threads in pool, default %d\n"
" -t number of tasks, default %d\n"
, av0, DEFAULT_THREADS, DEFAULT_TASKS);
exit(exvalue);
}
int
main(int ac, char *av[])
{
int c, nthreads = DEFAULT_THREADS, ntasks = DEFAULT_TASKS;
while ((c = getopt(ac, av, "hn:t:")) != EOF) {
switch (c) {
case 'n':
nthreads = atoi(optarg);
if (nthreads == 1) {
fprintf(stderr, "Cannot test for concurrency with only 1 thread\n");
abort();
}