plu_outofcore_example.c 8.4 KB

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