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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
/* StarPU --- Runtime system for heterogeneous multicore architectures.
*
* Copyright (C) 2012 Inria
* Copyright (C) 2010-2013,2015 CNRS
* Copyright (C) 2009-2010,2012-2014 Université de Bordeaux
*
* StarPU is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation; either version 2.1 of the License, or (at
* your option) any later version.
*
* StarPU is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*
* See the GNU Lesser General Public License in COPYING.LGPL for more details.
*/
/* This example shows how to make a task depend on either of a series of tasks.
*
* For each i, we submit i tasks of type A, which fill the i-th variable, and i
* tasks of type B, which check that the i-th variable is filled. Thanks to
* tag dependency, B tasks are scheduled as soon as one of the corresponding A
* task is finished.
*/
#include <string.h>
#include <math.h>
#include <sys/types.h>
#include <signal.h>
#include <starpu.h>
#define FPRINTF(ofile, fmt, ...) do { if (!getenv("STARPU_SSILENT")) {fprintf(ofile, fmt, ## __VA_ARGS__); }} while(0)
#define TAG(i, iter) ((starpu_tag_t) (((uint64_t)i)<<32 | (iter)) )
void cpu_codelet_A(void *descr[], void *_args)
{
int *arg = _args;
*arg = 1;
fprintf(stderr,"A");
}
void cpu_codelet_B(void *descr[], void *_args)
{
int *arg = _args;
if (*arg != 1)
exit(EXIT_FAILURE);
fprintf(stderr,"B");
}
struct starpu_codelet cl_A =
{
.cpu_funcs = { cpu_codelet_A},
.cuda_funcs = { cpu_codelet_A},
.opencl_funcs = { cpu_codelet_A},
.nbuffers = 0,
.name = "dummyA"
};
struct starpu_codelet cl_B =
{
.cpu_funcs = { cpu_codelet_B},
.cuda_funcs = { cpu_codelet_B},
.opencl_funcs = { cpu_codelet_B},
.nbuffers = 0,
.name = "dummyB"
};
#define Ni 64
static unsigned ni = Ni;
static void parse_args(int argc, char **argv)
{
int i;
for (i = 1; i < argc; i++)
{
if (strcmp(argv[i], "-iter") == 0)
{
char *argptr;
ni = strtol(argv[++i], &argptr, 10);
}
if (strcmp(argv[i], "-h") == 0)
{
printf("usage : %s [-iter iter]\n", argv[0]);
}
}
}
int main(int argc STARPU_ATTRIBUTE_UNUSED , char **argv STARPU_ATTRIBUTE_UNUSED)
{
unsigned i, j;
int ret;
ret = starpu_init(NULL);
if (ret == -ENODEV)
exit(77);
STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
parse_args(argc, argv);
FPRINTF(stderr, "ITER : %u\n", ni);
{
int array[ni];
memset(array, 0, sizeof(array));
for (i = 1; i < ni; i++)
{
for (j = 1; j < i; j++)
{
struct starpu_task *task_A = starpu_task_create();
task_A->cl = &cl_A;
task_A->cl_arg = &array[i];
task_A->use_tag = 1;
task_A->tag_id = TAG(0, i);
ret = starpu_task_submit(task_A);
if (ret == -ENODEV) goto enodev;
STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
}
for (j = 1; j < i; j++)
{
struct starpu_task *task_B = starpu_task_create();
task_B->cl = &cl_B;
task_B->cl_arg = &array[i];
task_B->use_tag = 1;
task_B->tag_id = TAG(j, i);
starpu_tag_declare_deps(TAG(j, i), 1, TAG(0, i));
ret = starpu_task_submit(task_B);
if (ret == -ENODEV) goto enodev;
STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
}
}
starpu_task_wait_for_all();
}
for (i = 1; i < ni; i++)
{
for (j = 0; j < i; j++)
starpu_tag_remove(TAG(j, i));
}
enodev:
starpu_shutdown();
FPRINTF(stderr, "TEST DONE ...\n");
if (ret == -ENODEV) return 77; else return 0;
}
|
