plu_outofcore_example.c 8.5 KB

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