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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
/* StarPU --- Runtime system for heterogeneous multicore architectures.
*
* Copyright (C) 2012 Inria
* Copyright (C) 2009-2011,2013-2015 Université de Bordeaux
* Copyright (C) 2010-2013,2015-2016 CNRS
*
* 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 reuse a tag.
* We define a series of dependency chains, shaped this way:
*
* ... ...
* v v
* ... task (i, j) task (i, j+1) ...
* v v
* ... task (i+1,j) task (i+1,j+1) ...
* v v
* ... ...
*
* And this grid is used several times, by waiting for the completion of a
* chain before starting it over.
*/
#include <sys/types.h>
#include <semaphore.h>
#include <string.h>
#include <math.h>
#include <unistd.h>
#include <signal.h>
#include <starpu.h>
#define Nrolls 4
#define SLEEP 1
#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)((iter)%Nrolls))<<32 | (i)) )
struct starpu_codelet cl;
#define Ni 64
#define Nk 256
static unsigned ni = Ni, nk = Nk;
struct starpu_task **tasks[Nrolls];
static void parse_args(int argc, char **argv)
{
int i;
for (i = 1; i < argc; i++)
{
if (strcmp(argv[i], "-iter") == 0)
{
char *argptr;
nk = strtol(argv[++i], &argptr, 10);
}
if (strcmp(argv[i], "-i") == 0)
{
char *argptr;
ni = strtol(argv[++i], &argptr, 10);
}
if (strcmp(argv[i], "-h") == 0)
{
printf("usage : %s [-iter iter] [-i i]\n", argv[0]);
}
}
}
void callback_cpu(void *argcb);
static void create_task_grid(unsigned iter)
{
unsigned i;
FPRINTF(stderr, "init iter %u ni %u...\n", iter, ni);
for (i = 0; i < ni; i++)
{
/* create a new task */
struct starpu_task *task = tasks[iter][i] = starpu_task_create();
task->cl = &cl;
/* task->cl_arg = (void*)(uintptr_t) (i | (iter << 16)); */
task->use_tag = 1;
task->tag_id = TAG(i, iter);
task->detach = 1;
task->destroy = 0;
if (i != 0)
starpu_tag_declare_deps(TAG(i,iter), 1, TAG(i-1,iter));
}
}
static int start_task_grid(unsigned iter)
{
unsigned i;
/* FPRINTF(stderr, "start grid %d ni %d...\n", iter, ni); */
for (i = 0; i < ni; i++)
{
int ret;
ret = starpu_task_submit(tasks[iter][i]);
if (ret == -ENODEV) return 77;
STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
}
return 0;
}
void cpu_codelet(void *descr[] STARPU_ATTRIBUTE_UNUSED, void *_args STARPU_ATTRIBUTE_UNUSED)
{
/* int i = (uintptr_t) _args;
printf("doing %x\n", i);
usleep(SLEEP);
printf("done %x\n", i);
*/
}
int main(int argc STARPU_ATTRIBUTE_UNUSED , char **argv STARPU_ATTRIBUTE_UNUSED)
{
unsigned i, j;
int ret;
ret = starpu_init(NULL);
if (ret == -ENODEV)
return 77;
STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
#ifdef STARPU_QUICK_CHECK
ni /= 4;
nk /= 16;
#endif
parse_args(argc, argv);
starpu_codelet_init(&cl);
cl.cpu_funcs[0] = cpu_codelet;
cl.cpu_funcs_name[0] = "cpu_codelet";
cl.cuda_funcs[0] = cpu_codelet;
cl.opencl_funcs[0] = cpu_codelet;
cl.nbuffers = 0;
cl.name = "dummy";
FPRINTF(stderr, "ITER : %u\n", nk);
for (i = 0; i < Nrolls; i++)
{
tasks[i] = (struct starpu_task **) malloc(ni * sizeof(*tasks[i]));
create_task_grid(i);
}
for (i = 0; i < nk; i++)
{
ret = start_task_grid(i % Nrolls);
if (ret == 77) goto enodev;
if (i+1 >= Nrolls)
/* Wait before re-using same tasks & tags */
starpu_tag_wait(TAG(ni-1, i + 1));
}
starpu_shutdown();
FPRINTF(stderr, "TEST DONE ...\n");
enodev:
for (i = 0; i < Nrolls; i++)
{
for (j = 0; j < ni; j++)
starpu_task_destroy(tasks[i][j]);
free(tasks[i]);
}
return ret;
}
|
