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 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 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407
|
/* StarPU --- Runtime system for heterogeneous multicore architectures.
*
* Copyright (C) 2009-2012 Université de Bordeaux 1
* Copyright (C) 2010 Mehdi Juhoor <mjuhoor@gmail.com>
* Copyright (C) 2010, 2011, 2012 Centre National de la Recherche Scientifique
*
* 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.
*/
#include "cholesky.h"
/*
* Some useful functions
*/
static struct starpu_task *create_task(starpu_tag_t id)
{
struct starpu_task *task = starpu_task_create();
task->cl_arg = NULL;
task->use_tag = 1;
task->tag_id = id;
return task;
}
/*
* Create the codelets
*/
static struct starpu_codelet cl11 =
{
.modes = { STARPU_RW },
.where = STARPU_CPU|STARPU_CUDA,
.cpu_funcs = {chol_cpu_codelet_update_u11, NULL},
#ifdef STARPU_USE_CUDA
.cuda_funcs = {chol_cublas_codelet_update_u11, NULL},
#endif
.nbuffers = 1,
.model = &chol_model_11
};
static struct starpu_task * create_task_11(starpu_data_handle_t dataA, unsigned k)
{
/* FPRINTF(stdout, "task 11 k = %d TAG = %llx\n", k, (TAG11(k))); */
struct starpu_task *task = create_task(TAG11(k));
task->cl = &cl11;
/* which sub-data is manipulated ? */
task->handles[0] = starpu_data_get_sub_data(dataA, 2, k, k);
/* this is an important task */
if (!noprio)
task->priority = STARPU_MAX_PRIO;
/* enforce dependencies ... */
if (k > 0)
{
starpu_tag_declare_deps(TAG11(k), 1, TAG22(k-1, k, k));
}
return task;
}
static struct starpu_codelet cl21 =
{
.modes = { STARPU_R, STARPU_RW },
.where = STARPU_CPU|STARPU_CUDA,
.cpu_funcs = {chol_cpu_codelet_update_u21, NULL},
#ifdef STARPU_USE_CUDA
.cuda_funcs = {chol_cublas_codelet_update_u21, NULL},
#endif
.nbuffers = 2,
.model = &chol_model_21
};
static void create_task_21(starpu_data_handle_t dataA, unsigned k, unsigned j)
{
struct starpu_task *task = create_task(TAG21(k, j));
task->cl = &cl21;
/* which sub-data is manipulated ? */
task->handles[0] = starpu_data_get_sub_data(dataA, 2, k, k);
task->handles[1] = starpu_data_get_sub_data(dataA, 2, k, j);
if (!noprio && (j == k+1))
{
task->priority = STARPU_MAX_PRIO;
}
/* enforce dependencies ... */
if (k > 0)
{
starpu_tag_declare_deps(TAG21(k, j), 2, TAG11(k), TAG22(k-1, k, j));
}
else
{
starpu_tag_declare_deps(TAG21(k, j), 1, TAG11(k));
}
int ret = starpu_task_submit(task);
if (STARPU_UNLIKELY(ret == -ENODEV))
{
FPRINTF(stderr, "No worker may execute this task\n");
exit(0);
}
}
static struct starpu_codelet cl22 =
{
.modes = { STARPU_R, STARPU_R, STARPU_RW },
.where = STARPU_CPU|STARPU_CUDA,
.cpu_funcs = {chol_cpu_codelet_update_u22, NULL},
#ifdef STARPU_USE_CUDA
.cuda_funcs = {chol_cublas_codelet_update_u22, NULL},
#endif
.nbuffers = 3,
.model = &chol_model_22
};
static void create_task_22(starpu_data_handle_t dataA, unsigned k, unsigned i, unsigned j)
{
/* FPRINTF(stdout, "task 22 k,i,j = %d,%d,%d TAG = %llx\n", k,i,j, TAG22(k,i,j)); */
struct starpu_task *task = create_task(TAG22(k, i, j));
task->cl = &cl22;
/* which sub-data is manipulated ? */
task->handles[0] = starpu_data_get_sub_data(dataA, 2, k, i);
task->handles[1] = starpu_data_get_sub_data(dataA, 2, k, j);
task->handles[2] = starpu_data_get_sub_data(dataA, 2, i, j);
if (!noprio && (i == k + 1) && (j == k +1) )
{
task->priority = STARPU_MAX_PRIO;
}
/* enforce dependencies ... */
if (k > 0)
{
starpu_tag_declare_deps(TAG22(k, i, j), 3, TAG22(k-1, i, j), TAG21(k, i), TAG21(k, j));
}
else
{
starpu_tag_declare_deps(TAG22(k, i, j), 2, TAG21(k, i), TAG21(k, j));
}
int ret = starpu_task_submit(task);
if (STARPU_UNLIKELY(ret == -ENODEV))
{
FPRINTF(stderr, "No worker may execute this task\n");
exit(0);
}
}
/*
* code to bootstrap the factorization
* and construct the DAG
*/
static void _cholesky(starpu_data_handle_t dataA, unsigned nblocks)
{
struct timeval start;
struct timeval end;
struct starpu_task *entry_task = NULL;
/* create all the DAG nodes */
unsigned i,j,k;
gettimeofday(&start, NULL);
for (k = 0; k < nblocks; k++)
{
struct starpu_task *task = create_task_11(dataA, k);
/* we defer the launch of the first task */
if (k == 0)
{
entry_task = task;
}
else
{
int ret = starpu_task_submit(task);
if (STARPU_UNLIKELY(ret == -ENODEV))
{
FPRINTF(stderr, "No worker may execute this task\n");
exit(0);
}
}
for (j = k+1; j<nblocks; j++)
{
create_task_21(dataA, k, j);
for (i = k+1; i<nblocks; i++)
{
if (i <= j)
create_task_22(dataA, k, i, j);
}
}
}
/* schedule the codelet */
int ret = starpu_task_submit(entry_task);
if (STARPU_UNLIKELY(ret == -ENODEV))
{
FPRINTF(stderr, "No worker may execute this task\n");
exit(0);
}
/* stall the application until the end of computations */
starpu_tag_wait(TAG11(nblocks-1));
starpu_data_unpartition(dataA, 0);
gettimeofday(&end, NULL);
double timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
FPRINTF(stderr, "Computation took (in ms)\n");
FPRINTF(stdout, "%2.2f\n", timing/1000);
unsigned n = starpu_matrix_get_nx(dataA);
double flop = (1.0f*n*n*n)/3.0f;
FPRINTF(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));
}
static int initialize_system(float **A, unsigned dim, unsigned pinned)
{
int ret;
ret = starpu_init(NULL);
if (ret == -ENODEV)
return 77;
STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
starpu_helper_cublas_init();
if (pinned)
{
starpu_malloc((void **)A, (size_t)dim*dim*sizeof(float));
}
else
{
*A = malloc(dim*dim*sizeof(float));
}
return 0;
}
static void cholesky(float *matA, unsigned size, unsigned ld, unsigned nblocks)
{
starpu_data_handle_t dataA;
/* monitor and partition the A matrix into blocks :
* one block is now determined by 2 unsigned (i,j) */
starpu_matrix_data_register(&dataA, 0, (uintptr_t)matA, ld, size, size, sizeof(float));
starpu_data_set_sequential_consistency_flag(dataA, 0);
struct starpu_data_filter f =
{
.filter_func = starpu_vertical_block_filter_func,
.nchildren = nblocks
};
struct starpu_data_filter f2 =
{
.filter_func = starpu_block_filter_func,
.nchildren = nblocks
};
starpu_data_map_filters(dataA, 2, &f, &f2);
_cholesky(dataA, nblocks);
starpu_data_unregister(dataA);
}
static void shutdown_system(float **matA, unsigned pinned)
{
if (pinned)
{
starpu_free(*matA);
}
else
{
free(*matA);
}
starpu_helper_cublas_shutdown();
starpu_shutdown();
}
int main(int argc, char **argv)
{
/* create a simple definite positive symetric matrix example
*
* Hilbert matrix : h(i,j) = 1/(i+j+1)
* */
parse_args(argc, argv);
float *mat;
int ret = initialize_system(&mat, size, pinned);
if (ret) return ret;
unsigned i,j;
for (i = 0; i < size; i++)
{
for (j = 0; j < size; j++)
{
mat[j +i*size] = (1.0f/(1.0f+i+j)) + ((i == j)?1.0f*size:0.0f);
/* mat[j +i*size] = ((i == j)?1.0f*size:0.0f); */
}
}
#ifdef CHECK_OUTPUT
FPRINTF(stdout, "Input :\n");
for (j = 0; j < size; j++)
{
for (i = 0; i < size; i++)
{
if (i <= j)
{
FPRINTF(stdout, "%2.2f\t", mat[j +i*size]);
}
else
{
FPRINTF(stdout, ".\t");
}
}
FPRINTF(stdout, "\n");
}
#endif
cholesky(mat, size, size, nblocks);
#ifdef CHECK_OUTPUT
FPRINTF(stdout, "Results :\n");
for (j = 0; j < size; j++)
{
for (i = 0; i < size; i++)
{
if (i <= j)
{
FPRINTF(stdout, "%2.2f\t", mat[j +i*size]);
}
else
{
FPRINTF(stdout, ".\t");
mat[j+i*size] = 0.0f; /* debug */
}
}
FPRINTF(stdout, "\n");
}
FPRINTF(stderr, "compute explicit LLt ...\n");
float *test_mat = malloc(size*size*sizeof(float));
STARPU_ASSERT(test_mat);
SSYRK("L", "N", size, size, 1.0f,
mat, size, 0.0f, test_mat, size);
FPRINTF(stderr, "comparing results ...\n");
for (j = 0; j < size; j++)
{
for (i = 0; i < size; i++)
{
if (i <= j)
{
FPRINTF(stdout, "%2.2f\t", test_mat[j +i*size]);
}
else
{
FPRINTF(stdout, ".\t");
}
}
FPRINTF(stdout, "\n");
}
free(test_mat);
#endif
shutdown_system(&mat, pinned);
return 0;
}
|