Newer
Older
/**
*
* @file starpu/codelet_zperm_allreduce.c
*
* @copyright 2012-2024 Bordeaux INP, CNRS (LaBRI UMR 5800), Inria,
* Univ. Bordeaux. All rights reserved.
*
***
*
* @brief Chameleon StarPU codelets to do the reduction
*
* @version 1.3.0
* @author Alycia Lisito
* @date 2024-06-11
* @precisions normal z -> c d s
*
*/
#include "chameleon_starpu_internal.h"
#include "runtime_codelet_z.h"
#include <coreblas/cblas_wrapper.h>
#if defined(CHAMELEON_USE_MPI)
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
struct cl_redux_args_t {
int tempmm;
int n;
int p;
int q;
int p_first;
int me;
int shift;
int np_inv;
};
static void
cl_zperm_allreduce_cpu_func( void *descr[], void *cl_arg )
{
struct cl_redux_args_t *clargs = (struct cl_redux_args_t *) cl_arg;
const CHAM_tile_t *tileUinout = cti_interface_get( descr[0] );
const CHAM_tile_t *tileUin = cti_interface_get( descr[1] );
const int *perm = (int *)STARPU_VECTOR_GET_PTR( descr[2] );
CHAMELEON_Complex64_t *Uinout = CHAM_tile_get_ptr( tileUinout );
const CHAMELEON_Complex64_t *Uin = CHAM_tile_get_ptr( tileUin );
int tempmm = clargs->tempmm;
int n = clargs->n;
int p = clargs->p;
int q = clargs->q;
int p_first = clargs->p_first / q;
int shift = clargs->shift;
int np = clargs->np_inv;
int me = ( p <= np ) ? clargs->me / q : ( ( clargs->me / q ) - p_first + p ) % p;
int nb = tileUinout->n;
int mb = tileUinout->m;
int first = me - 2 * shift + 1;
int last = me - shift;
int i, m, ownerp;
for ( i = 0; i < tempmm; i++ ) {
m = perm[ i ] / mb;
ownerp = ( p <= np ) ? ( (m % p) * q + (n % q) ) / q : ( ( (m % p) * q + (n % q) ) / q - p_first + p ) % p;
if ( ( (first <= ownerp) && (ownerp <= last ) ) ||
( (first+np <= ownerp) && (ownerp <= last+np) ) )
{
cblas_zcopy( nb, Uin + i, tileUin->ld,
Uinout + i, tileUinout->ld );
}
}
}
CODELETS_CPU( zperm_allreduce, cl_zperm_allreduce_cpu_func )
static void
INSERT_TASK_zperm_allreduce_send( const RUNTIME_option_t *options,
CHAM_desc_t *U,
int me,
int dst,
int n )
{
rt_starpu_insert_task(
NULL,
STARPU_EXECUTE_ON_NODE, dst,
STARPU_R, RTBLKADDR(U, CHAMELEON_Complex64_t, me, n),
STARPU_PRIORITY, options->priority,
0 );
}
static void
INSERT_TASK_zperm_allreduce_recv( const RUNTIME_option_t *options,
CHAM_desc_t *U,
CHAM_ipiv_t *ipiv,
int ipivk,
int me,
int src,
int n,
int tempmm,
int p,
int q,
int shift,
int np,
int p_first )
{
struct cl_redux_args_t *clargs;
clargs = malloc( sizeof( struct cl_redux_args_t ) );
clargs->tempmm = tempmm;
clargs->n = n;
clargs->p = p;
clargs->q = q;
clargs->p_first = p_first;
clargs->me = me;
clargs->shift = shift;
clargs->np_inv = np;
rt_starpu_insert_task(
&cl_zperm_allreduce,
STARPU_CL_ARGS, clargs, sizeof(struct cl_redux_args_t),
STARPU_RW, RTBLKADDR(U, CHAMELEON_Complex64_t, me, n),
STARPU_R, RTBLKADDR(U, CHAMELEON_Complex64_t, src, n),
STARPU_R, RUNTIME_perm_getaddr( ipiv, ipivk ),
STARPU_EXECUTE_ON_NODE, me,
STARPU_EXECUTE_ON_WORKER, options->workerid,
STARPU_PRIORITY, options->priority,
0 );
starpu_mpi_cache_flush( options->sequence->comm, RTBLKADDR(U, CHAMELEON_Complex64_t, src, n) );
}
void
INSERT_TASK_zperm_allreduce( const RUNTIME_option_t *options,
const CHAM_desc_t *A,
CHAM_ipiv_t *ipiv,
int ipivk,
int k,
int n,
CHAM_desc_t *U,
int Um,
int Un,
void *ws )
{
struct chameleon_pzgetrf_s *tmp = (struct chameleon_pzgetrf_s *)ws;
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
int *proc_involved = tmp->proc_involved;
int np_involved = chameleon_min( A->p, A->mt - k);
int np_iter = np_involved;
int p_recv, p_send, me, p_first;
int shift = 1;
if ( np_involved == 1 ) {
assert( proc_involved[0] == A->myrank );
}
else {
p_first = proc_involved[0];
for( me = 0; me < np_involved; me++ ) {
if ( proc_involved[me] == A->myrank ) {
break;
}
}
assert( me < np_involved );
while ( np_iter > 1 ) {
p_send = proc_involved[ ( me + shift ) % np_involved ];
p_recv = proc_involved[ ( me - shift + np_involved ) % np_involved ];
INSERT_TASK_zperm_allreduce_send( options, U, A->myrank, p_send, n );
INSERT_TASK_zperm_allreduce_recv( options, U, ipiv, ipivk, A->myrank, p_recv,
n, k == (A->mt-1) ? A->m - k * A->mb : A->mb,
A->p, A->q, shift, np_involved, p_first );
shift = shift << 1;
np_iter = chameleon_ceil( np_iter, 2 );
}
}
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
}
void
INSERT_TASK_zperm_allreduce_send_A( const RUNTIME_option_t *options,
CHAM_desc_t *A,
int Am,
int An,
int myrank,
int np,
int *proc_involved )
{
int p, rank;
for ( p = 0; p < np; p ++ ) {
if ( proc_involved[ p ] == myrank ) {
continue;
}
starpu_mpi_get_data_on_node_detached( options->sequence->comm,
RTBLKADDR(A, CHAMELEON_Complex64_t, Am, An),
proc_involved[ p ], NULL, NULL );
}
}
void
INSERT_TASK_zperm_allreduce_send_perm( const RUNTIME_option_t *options,
CHAM_ipiv_t *ipiv,
int ipivk,
int myrank,
int np,
int *proc_involved )
{
int p;
for ( p = 0; p < np; p++ ) {
if ( proc_involved[ p ] == myrank ) {
continue;
}
starpu_mpi_get_data_on_node_detached( options->sequence->comm,
RUNTIME_perm_getaddr( ipiv, ipivk ),
proc_involved[ p ], NULL, NULL );
}
}
void
INSERT_TASK_zperm_allreduce_send_invp( const RUNTIME_option_t *options,
CHAM_ipiv_t *ipiv,
int ipivk,
const CHAM_desc_t *A,
int k,
int n )
{
int b, rank;
for ( b = k+1; (b < A->mt) && ((b-(k+1)) < A->p); b ++ ) {
rank = A->get_rankof( A, b, n );
if ( rank == A->myrank ) {
continue;
}
starpu_mpi_get_data_on_node_detached( options->sequence->comm,
RUNTIME_invp_getaddr( ipiv, ipivk ),
rank, NULL, NULL );
}
}
#else
void
INSERT_TASK_zperm_allreduce_send_A( const RUNTIME_option_t *options,
CHAM_desc_t *A,
int Am,
int An,
int myrank,
int np,
int *proc_involved )
{
(void)options;
(void)A;
(void)Am;
(void)An;
(void)myrank;
(void)np;
(void)proc_involved;
}
void
INSERT_TASK_zperm_allreduce_send_perm( const RUNTIME_option_t *options,
CHAM_ipiv_t *ipiv,
int ipivk,
int myrank,
int np,
int *proc_involved )
{
(void)options;
(void)ipiv;
(void)ipivk;
(void)myrank;
(void)np;
(void)proc_involved;
}
void
INSERT_TASK_zperm_allreduce_send_invp( const RUNTIME_option_t *options,
CHAM_ipiv_t *ipiv,
int ipivk,
const CHAM_desc_t *A,
int k,
int n )
{
(void)options;
(void)ipiv;
(void)ipivk;
(void)A;
(void)k;
(void)n;
}
void
INSERT_TASK_zperm_allreduce( const RUNTIME_option_t *options,
const CHAM_desc_t *A,
CHAM_ipiv_t *ipiv,
int ipivk,
int k,
int n,
CHAM_desc_t *U,
int Um,
int Un,
void *ws )
{
(void)options;
(void)A;
(void)ipiv;
(void)ipivk;
(void)k;
(void)n;
(void)U;
(void)Um;
(void)Un;
(void)ws;
}
#endif