plu_implicit_example.c 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2020 Université de Bordeaux, CNRS (LaBRI UMR 5800), Inria
  4. * Copyright (C) 2013 Thibaut Lambert
  5. *
  6. * StarPU is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU Lesser General Public License as published by
  8. * the Free Software Foundation; either version 2.1 of the License, or (at
  9. * your option) any later version.
  10. *
  11. * StarPU is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  14. *
  15. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  16. */
  17. #include <stdlib.h>
  18. #include <stdio.h>
  19. #include <string.h>
  20. #include <time.h>
  21. #include <math.h>
  22. #include <starpu.h>
  23. #include "pxlu.h"
  24. //#include "pxlu_kernels.h"
  25. #ifdef STARPU_HAVE_LIBNUMA
  26. #include <numaif.h>
  27. #endif
  28. static unsigned long size = 4096;
  29. static unsigned nblocks = 16;
  30. static unsigned check = 0;
  31. static int p = -1;
  32. static int q = -1;
  33. static unsigned display = 0;
  34. static unsigned no_prio = 0;
  35. #ifdef STARPU_HAVE_LIBNUMA
  36. static unsigned numa = 0;
  37. #endif
  38. static size_t allocated_memory = 0;
  39. static size_t allocated_memory_extra = 0;
  40. static starpu_data_handle_t *dataA_handles;
  41. static TYPE **dataA;
  42. int get_block_rank(unsigned i, unsigned j);
  43. static void parse_args(int argc, char **argv)
  44. {
  45. int i;
  46. for (i = 1; i < argc; i++)
  47. {
  48. if (strcmp(argv[i], "-size") == 0)
  49. {
  50. char *argptr;
  51. size = strtol(argv[++i], &argptr, 10);
  52. }
  53. if (strcmp(argv[i], "-nblocks") == 0)
  54. {
  55. char *argptr;
  56. nblocks = strtol(argv[++i], &argptr, 10);
  57. }
  58. if (strcmp(argv[i], "-check") == 0)
  59. {
  60. check = 1;
  61. }
  62. if (strcmp(argv[i], "-display") == 0)
  63. {
  64. display = 1;
  65. }
  66. if (strcmp(argv[i], "-numa") == 0)
  67. {
  68. #ifdef STARPU_HAVE_LIBNUMA
  69. numa = 1;
  70. #else
  71. fprintf(stderr, "Warning: libnuma is not available\n");
  72. #endif
  73. }
  74. if (strcmp(argv[i], "-p") == 0)
  75. {
  76. char *argptr;
  77. p = strtol(argv[++i], &argptr, 10);
  78. }
  79. if (strcmp(argv[i], "-q") == 0)
  80. {
  81. char *argptr;
  82. q = strtol(argv[++i], &argptr, 10);
  83. }
  84. if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "-help") == 0 || strcmp(argv[i], "--help") == 0)
  85. {
  86. fprintf(stderr,"usage: %s [-size n] [-nblocks b] [-check] [-display] [-numa] [-p p] [-q q]\n", argv[0]);
  87. fprintf(stderr,"\np * q must be equal to the number of MPI nodes\n");
  88. exit(0);
  89. }
  90. }
  91. #ifdef STARPU_HAVE_VALGRIND_H
  92. if (RUNNING_ON_VALGRIND)
  93. size = 16;
  94. #endif
  95. }
  96. unsigned STARPU_PLU(display_flag)(void)
  97. {
  98. return display;
  99. }
  100. static void fill_block_with_random(TYPE *blockptr, unsigned psize, unsigned pnblocks)
  101. {
  102. const unsigned block_size = (psize/pnblocks);
  103. unsigned i, j;
  104. for (i = 0; i < block_size; i++)
  105. for (j = 0; j < block_size; j++)
  106. {
  107. blockptr[j+i*block_size] = (TYPE)starpu_drand48();
  108. }
  109. }
  110. static void init_matrix(int rank)
  111. {
  112. #ifdef STARPU_HAVE_LIBNUMA
  113. if (numa)
  114. {
  115. fprintf(stderr, "Using INTERLEAVE policy\n");
  116. unsigned long nodemask = ((1<<0)|(1<<1));
  117. int ret = set_mempolicy(MPOL_INTERLEAVE, &nodemask, 3);
  118. if (ret)
  119. perror("set_mempolicy failed");
  120. }
  121. #endif
  122. /* Allocate a grid of data handles, not all of them have to be allocated later on */
  123. dataA_handles = calloc(nblocks*nblocks, sizeof(starpu_data_handle_t));
  124. dataA = calloc(nblocks*nblocks, sizeof(TYPE *));
  125. allocated_memory_extra += nblocks*nblocks*(sizeof(starpu_data_handle_t) + sizeof(TYPE *));
  126. size_t blocksize = (size_t)(size/nblocks)*(size/nblocks)*sizeof(TYPE);
  127. /* Allocate all the blocks that belong to this mpi node */
  128. unsigned long i,j;
  129. for (j = 0; j < nblocks; j++)
  130. {
  131. for (i = 0; i < nblocks; i++)
  132. {
  133. int block_rank = get_block_rank(i, j);
  134. TYPE **blockptr = &dataA[j+i*nblocks];
  135. // starpu_data_handle_t *handleptr = &dataA_handles[j+nblocks*i];
  136. starpu_data_handle_t *handleptr = &dataA_handles[j+nblocks*i];
  137. if (block_rank == rank)
  138. {
  139. /* This blocks should be treated by the current MPI process */
  140. /* Allocate and fill it */
  141. starpu_malloc((void **)blockptr, blocksize);
  142. allocated_memory += blocksize;
  143. //fprintf(stderr, "Rank %d : fill block (i = %d, j = %d)\n", rank, i, j);
  144. fill_block_with_random(*blockptr, size, nblocks);
  145. //fprintf(stderr, "Rank %d : fill block (i = %d, j = %d)\n", rank, i, j);
  146. if (i == j)
  147. {
  148. unsigned tmp;
  149. for (tmp = 0; tmp < size/nblocks; tmp++)
  150. {
  151. (*blockptr)[tmp*((size/nblocks)+1)] += (TYPE)10*nblocks;
  152. }
  153. }
  154. /* Register it to StarPU */
  155. starpu_matrix_data_register(handleptr, STARPU_MAIN_RAM,
  156. (uintptr_t)*blockptr, size/nblocks,
  157. size/nblocks, size/nblocks, sizeof(TYPE));
  158. }
  159. else
  160. {
  161. starpu_matrix_data_register(handleptr, -1,
  162. 0, size/nblocks,
  163. size/nblocks, size/nblocks, sizeof(TYPE));
  164. *blockptr = STARPU_POISON_PTR;
  165. }
  166. starpu_data_set_coordinates(*handleptr, 2, j, i);
  167. starpu_mpi_data_register(*handleptr, j+i*nblocks, block_rank);
  168. }
  169. }
  170. //display_all_blocks(nblocks, size/nblocks);
  171. }
  172. TYPE *STARPU_PLU(get_block)(unsigned i, unsigned j)
  173. {
  174. return dataA[j+i*nblocks];
  175. }
  176. int get_block_rank(unsigned i, unsigned j)
  177. {
  178. /* Take a 2D block cyclic distribution */
  179. /* NB: p (resp. q) is for "direction" i (resp. j) */
  180. return (j % q) * p + (i % p);
  181. }
  182. starpu_data_handle_t STARPU_PLU(get_block_handle)(unsigned i, unsigned j)
  183. {
  184. return dataA_handles[j+i*nblocks];
  185. }
  186. static void display_grid(int rank, unsigned pnblocks)
  187. {
  188. if (!display)
  189. return;
  190. //if (rank == 0)
  191. {
  192. fprintf(stderr, "2D grid layout (Rank %d): \n", rank);
  193. unsigned i, j;
  194. for (j = 0; j < pnblocks; j++)
  195. {
  196. for (i = 0; i < pnblocks; i++)
  197. {
  198. TYPE *blockptr = STARPU_PLU(get_block)(i, j);
  199. starpu_data_handle_t handle = STARPU_PLU(get_block_handle)(i, j);
  200. fprintf(stderr, "%d (data %p handle %p)", get_block_rank(i, j), blockptr, handle);
  201. }
  202. fprintf(stderr, "\n");
  203. }
  204. }
  205. }
  206. int main(int argc, char **argv)
  207. {
  208. int rank;
  209. int world_size;
  210. int ret;
  211. starpu_srand48((long int)time(NULL));
  212. parse_args(argc, argv);
  213. ret = starpu_mpi_init_conf(&argc, &argv, 1, MPI_COMM_WORLD, NULL);
  214. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init_conf");
  215. starpu_mpi_comm_rank(MPI_COMM_WORLD, &rank);
  216. starpu_mpi_comm_size(MPI_COMM_WORLD, &world_size);
  217. if (p == -1 && q==-1)
  218. {
  219. fprintf(stderr, "Setting default values for p and q\n");
  220. p = (q % 2 == 0) ? 2 : 1;
  221. q = world_size / p;
  222. }
  223. STARPU_ASSERT_MSG(p*q == world_size, "p=%d, q=%d, world_size=%d\n", p, q, world_size);
  224. starpu_cublas_init();
  225. /*
  226. * Problem Init
  227. */
  228. init_matrix(rank);
  229. fprintf(stderr, "Rank %d: allocated (%d + %d) MB = %d MB\n", rank,
  230. (int)(allocated_memory/(1024*1024)),
  231. (int)(allocated_memory_extra/(1024*1024)),
  232. (int)((allocated_memory+allocated_memory_extra)/(1024*1024)));
  233. display_grid(rank, nblocks);
  234. TYPE *a_r = NULL;
  235. // STARPU_PLU(display_data_content)(a_r, size);
  236. if (check)
  237. {
  238. TYPE *x, *y;
  239. x = calloc(size, sizeof(TYPE));
  240. STARPU_ASSERT(x);
  241. y = calloc(size, sizeof(TYPE));
  242. STARPU_ASSERT(y);
  243. if (rank == 0)
  244. {
  245. unsigned ind;
  246. for (ind = 0; ind < size; ind++)
  247. x[ind] = (TYPE)starpu_drand48();
  248. }
  249. a_r = STARPU_PLU(reconstruct_matrix)(size, nblocks);
  250. if (rank == 0)
  251. STARPU_PLU(display_data_content)(a_r, size);
  252. // STARPU_PLU(compute_ax)(size, x, y, nblocks, rank);
  253. free(x);
  254. free(y);
  255. }
  256. double timing = STARPU_PLU(plu_main)(nblocks, rank, world_size, no_prio);
  257. /*
  258. * Report performance
  259. */
  260. if (rank == 0)
  261. {
  262. fprintf(stderr, "Computation took: %f ms\n", timing/1000);
  263. unsigned n = size;
  264. double flop = (2.0f*n*n*n)/3.0f;
  265. fprintf(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));
  266. }
  267. /*
  268. * Test Result Correctness
  269. */
  270. if (check)
  271. {
  272. /*
  273. * Compute || A - LU ||
  274. */
  275. STARPU_PLU(compute_lu_matrix)(size, nblocks, a_r);
  276. #if 0
  277. /*
  278. * Compute || Ax - LUx ||
  279. */
  280. unsigned ind;
  281. y2 = calloc(size, sizeof(TYPE));
  282. STARPU_ASSERT(y);
  283. if (rank == 0)
  284. {
  285. for (ind = 0; ind < size; ind++)
  286. {
  287. y2[ind] = (TYPE)0.0;
  288. }
  289. }
  290. STARPU_PLU(compute_lux)(size, x, y2, nblocks, rank);
  291. /* Compute y2 = y2 - y */
  292. CPU_AXPY(size, -1.0, y, 1, y2, 1);
  293. TYPE err = CPU_ASUM(size, y2, 1);
  294. int max = CPU_IAMAX(size, y2, 1);
  295. fprintf(stderr, "(A - LU)X Avg error : %e\n", err/(size*size));
  296. fprintf(stderr, "(A - LU)X Max error : %e\n", y2[max]);
  297. #endif
  298. }
  299. /*
  300. * Termination
  301. */
  302. starpu_cublas_shutdown();
  303. starpu_mpi_shutdown();
  304. return 0;
  305. }