plu_outofcore_example.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402
  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 <unistd.h>
  20. #include <string.h>
  21. #include <time.h>
  22. #include <math.h>
  23. #include <starpu.h>
  24. #include <fcntl.h>
  25. #include <sys/stat.h>
  26. #include "pxlu.h"
  27. //#include "pxlu_kernels.h"
  28. #ifdef STARPU_HAVE_LIBNUMA
  29. #include <numaif.h>
  30. #endif
  31. static unsigned long size = 4096;
  32. static unsigned nblocks = 16;
  33. static unsigned check = 0;
  34. static int p = 1;
  35. static int q = 1;
  36. static unsigned display = 0;
  37. static unsigned no_prio = 0;
  38. static char *path = "./starpu-ooc-files";
  39. #ifdef STARPU_HAVE_LIBNUMA
  40. static unsigned numa = 0;
  41. #endif
  42. static size_t allocated_memory = 0;
  43. static starpu_data_handle_t *dataA_handles;
  44. int get_block_rank(unsigned i, unsigned j);
  45. static void parse_args(int argc, char **argv)
  46. {
  47. int i;
  48. for (i = 1; i < argc; i++)
  49. {
  50. if (strcmp(argv[i], "-size") == 0)
  51. {
  52. char *argptr;
  53. size = strtol(argv[++i], &argptr, 10);
  54. }
  55. if (strcmp(argv[i], "-nblocks") == 0)
  56. {
  57. char *argptr;
  58. nblocks = strtol(argv[++i], &argptr, 10);
  59. }
  60. if (strcmp(argv[i], "-check") == 0)
  61. {
  62. check = 1;
  63. }
  64. if (strcmp(argv[i], "-display") == 0)
  65. {
  66. display = 1;
  67. }
  68. if (strcmp(argv[i], "-numa") == 0)
  69. {
  70. #ifdef STARPU_HAVE_LIBNUMA
  71. numa = 1;
  72. #else
  73. fprintf(stderr, "Warning: libnuma is not available\n");
  74. #endif
  75. }
  76. if (strcmp(argv[i], "-p") == 0)
  77. {
  78. char *argptr;
  79. p = strtol(argv[++i], &argptr, 10);
  80. }
  81. if (strcmp(argv[i], "-q") == 0)
  82. {
  83. char *argptr;
  84. q = strtol(argv[++i], &argptr, 10);
  85. }
  86. if (strcmp(argv[i], "-path") == 0)
  87. {
  88. path = argv[++i];
  89. }
  90. if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "-help") == 0 || strcmp(argv[i], "--help") == 0)
  91. {
  92. fprintf(stderr,"usage: %s [-size n] [-nblocks b] [-check] [-display] [-numa] [-p p] [-q q] [-path PATH]\n", argv[0]);
  93. fprintf(stderr,"\np * q must be equal to the number of MPI nodes\n");
  94. exit(0);
  95. }
  96. }
  97. }
  98. unsigned STARPU_PLU(display_flag)(void)
  99. {
  100. return display;
  101. }
  102. static void fill_block_with_random(TYPE *blockptr, unsigned psize, unsigned pnblocks)
  103. {
  104. const unsigned block_size = (psize/pnblocks);
  105. unsigned i, j;
  106. for (i = 0; i < block_size; i++)
  107. for (j = 0; j < block_size; j++)
  108. {
  109. blockptr[j+i*block_size] = (TYPE)starpu_drand48();
  110. }
  111. }
  112. static void create_matrix()
  113. {
  114. size_t blocksize = (size_t)(size/nblocks)*(size/nblocks)*sizeof(TYPE);
  115. TYPE *blockptr = malloc(blocksize);
  116. int fd;
  117. char *filename;
  118. unsigned filename_length = strlen(path) + 1 + sizeof(nblocks)*3 + 1 + sizeof(nblocks)*3 + 1;
  119. filename = malloc(filename_length);
  120. allocated_memory += nblocks*nblocks*blocksize;
  121. /* Create the whole matrix on the disk */
  122. unsigned i,j;
  123. for (j = 0; j < nblocks; j++)
  124. {
  125. for (i = 0; i < nblocks; i++)
  126. {
  127. fill_block_with_random(blockptr, size, nblocks);
  128. if (i == j)
  129. {
  130. unsigned tmp;
  131. for (tmp = 0; tmp < size/nblocks; tmp++)
  132. {
  133. blockptr[tmp*((size/nblocks)+1)] += (TYPE)10*nblocks;
  134. }
  135. }
  136. snprintf(filename, filename_length, "%s/%u,%u", path, i, j);
  137. fd = open(filename, O_WRONLY|O_CREAT|O_TRUNC, 0777);
  138. if (fd < 0)
  139. {
  140. perror("open");
  141. exit(1);
  142. }
  143. if (write(fd, blockptr, blocksize) != (starpu_ssize_t) blocksize)
  144. {
  145. fprintf(stderr,"short write");
  146. exit(1);
  147. }
  148. if (close(fd) < 0)
  149. {
  150. perror("close");
  151. exit(1);
  152. }
  153. }
  154. }
  155. free(blockptr);
  156. free(filename);
  157. }
  158. static void init_matrix(int rank)
  159. {
  160. /* Allocate a grid of data handles, not all of them have to be allocated later on */
  161. dataA_handles = calloc(nblocks*nblocks, sizeof(starpu_data_handle_t));
  162. size_t blocksize = (size_t)(size/nblocks)*(size/nblocks)*sizeof(TYPE);
  163. int disk_node = starpu_disk_register(&starpu_disk_unistd_ops, path, STARPU_MAX(1024*1024, size*size*sizeof(TYPE)));
  164. assert(disk_node >= 0);
  165. char filename[sizeof(nblocks)*3 + 1 + sizeof(nblocks)*3 + 1];
  166. /* Allocate all the blocks that belong to this mpi node */
  167. unsigned i,j;
  168. for (j = 0; j < nblocks; j++)
  169. {
  170. for (i = 0; i < nblocks; i++)
  171. {
  172. int block_rank = get_block_rank(i, j);
  173. // starpu_data_handle_t *handleptr = &dataA_handles[j+nblocks*i];
  174. starpu_data_handle_t *handleptr = &dataA_handles[j+nblocks*i];
  175. if (block_rank == rank)
  176. {
  177. void *disk_obj;
  178. snprintf(filename, sizeof(filename), "%u,%u", i, j);
  179. /* Register it to StarPU */
  180. disk_obj = starpu_disk_open(disk_node, filename, blocksize);
  181. if (!disk_obj)
  182. {
  183. fprintf(stderr,"could not open %s\n", filename);
  184. exit(1);
  185. }
  186. starpu_matrix_data_register(handleptr, disk_node,
  187. (uintptr_t) disk_obj, size/nblocks,
  188. size/nblocks, size/nblocks, sizeof(TYPE));
  189. }
  190. else
  191. {
  192. starpu_matrix_data_register(handleptr, -1,
  193. 0, size/nblocks,
  194. size/nblocks, size/nblocks, sizeof(TYPE));
  195. }
  196. starpu_data_set_coordinates(*handleptr, 2, j, i);
  197. starpu_mpi_data_register(*handleptr, j+i*nblocks, block_rank);
  198. }
  199. }
  200. //display_all_blocks(nblocks, size/nblocks);
  201. }
  202. TYPE *STARPU_PLU(get_block)(unsigned i, unsigned j)
  203. {
  204. (void)i;
  205. (void)j;
  206. /* This does not really make sense in out of core */
  207. assert(0);
  208. }
  209. int get_block_rank(unsigned i, unsigned j)
  210. {
  211. /* Take a 2D block cyclic distribution */
  212. /* NB: p (resp. q) is for "direction" i (resp. j) */
  213. return (j % q) * p + (i % p);
  214. }
  215. starpu_data_handle_t STARPU_PLU(get_block_handle)(unsigned i, unsigned j)
  216. {
  217. return dataA_handles[j+i*nblocks];
  218. }
  219. int main(int argc, char **argv)
  220. {
  221. int rank;
  222. int world_size;
  223. int ret;
  224. unsigned i, j;
  225. starpu_srand48((long int)time(NULL));
  226. parse_args(argc, argv);
  227. ret = mkdir(path, 0777);
  228. if (ret != 0 && errno != EEXIST)
  229. {
  230. fprintf(stderr,"%s does not exist\n", path);
  231. exit(1);
  232. }
  233. ret = starpu_mpi_init_conf(&argc, &argv, 1, MPI_COMM_WORLD, NULL);
  234. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init_conf");
  235. starpu_mpi_comm_rank(MPI_COMM_WORLD, &rank);
  236. starpu_mpi_comm_size(MPI_COMM_WORLD, &world_size);
  237. STARPU_ASSERT(p*q == world_size);
  238. starpu_cublas_init();
  239. /*
  240. * Problem Init
  241. */
  242. if (rank == 0)
  243. create_matrix();
  244. starpu_mpi_barrier(MPI_COMM_WORLD);
  245. init_matrix(rank);
  246. if (rank == 0)
  247. fprintf(stderr, "%dMB on disk\n", (int)(allocated_memory/(1024*1024)));
  248. TYPE *a_r = NULL;
  249. // STARPU_PLU(display_data_content)(a_r, size);
  250. if (check)
  251. {
  252. TYPE *x, *y;
  253. x = calloc(size, sizeof(TYPE));
  254. STARPU_ASSERT(x);
  255. y = calloc(size, sizeof(TYPE));
  256. STARPU_ASSERT(y);
  257. if (rank == 0)
  258. {
  259. unsigned ind;
  260. for (ind = 0; ind < size; ind++)
  261. x[ind] = (TYPE)starpu_drand48();
  262. }
  263. a_r = STARPU_PLU(reconstruct_matrix)(size, nblocks);
  264. if (rank == 0)
  265. STARPU_PLU(display_data_content)(a_r, size);
  266. // STARPU_PLU(compute_ax)(size, x, y, nblocks, rank);
  267. free(x);
  268. free(y);
  269. }
  270. double timing = STARPU_PLU(plu_main)(nblocks, rank, world_size, no_prio);
  271. /*
  272. * Report performance
  273. */
  274. if (rank == 0)
  275. {
  276. fprintf(stderr, "Computation took: %f ms\n", timing/1000);
  277. unsigned n = size;
  278. double flop = (2.0f*n*n*n)/3.0f;
  279. fprintf(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));
  280. }
  281. /*
  282. * Test Result Correctness
  283. */
  284. if (check)
  285. {
  286. /*
  287. * Compute || A - LU ||
  288. */
  289. STARPU_PLU(compute_lu_matrix)(size, nblocks, a_r);
  290. #if 0
  291. /*
  292. * Compute || Ax - LUx ||
  293. */
  294. unsigned ind;
  295. y2 = calloc(size, sizeof(TYPE));
  296. STARPU_ASSERT(y);
  297. if (rank == 0)
  298. {
  299. for (ind = 0; ind < size; ind++)
  300. {
  301. y2[ind] = (TYPE)0.0;
  302. }
  303. }
  304. STARPU_PLU(compute_lux)(size, x, y2, nblocks, rank);
  305. /* Compute y2 = y2 - y */
  306. CPU_AXPY(size, -1.0, y, 1, y2, 1);
  307. TYPE err = CPU_ASUM(size, y2, 1);
  308. int max = CPU_IAMAX(size, y2, 1);
  309. fprintf(stderr, "(A - LU)X Avg error : %e\n", err/(size*size));
  310. fprintf(stderr, "(A - LU)X Max error : %e\n", y2[max]);
  311. #endif
  312. }
  313. /*
  314. * Termination
  315. */
  316. for (j = 0; j < nblocks; j++)
  317. {
  318. for (i = 0; i < nblocks; i++)
  319. {
  320. starpu_data_unregister(dataA_handles[j+nblocks*i]);
  321. }
  322. }
  323. starpu_cublas_shutdown();
  324. starpu_mpi_shutdown();
  325. return 0;
  326. }