mpi_decomposition_params.c 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009-2020 Université de Bordeaux, CNRS (LaBRI UMR 5800), Inria
  4. *
  5. * StarPU is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU Lesser General Public License as published by
  7. * the Free Software Foundation; either version 2.1 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * StarPU is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  15. */
  16. #include "mpi_cholesky.h"
  17. #include "helper.h"
  18. #include <string.h>
  19. #include <stdlib.h>
  20. #include <stdio.h>
  21. #include <math.h>
  22. #ifdef STARPU_HAVE_VALGRIND_H
  23. #include <valgrind/valgrind.h>
  24. #endif
  25. #ifdef STARPU_QUICK_CHECK
  26. unsigned size = 2*320;
  27. unsigned nblocks = 2;
  28. unsigned nbigblocks = 2;
  29. #elif !defined(STARPU_LONG_CHECK)
  30. unsigned size = 4*320;
  31. unsigned nblocks = 4;
  32. unsigned nbigblocks = 2;
  33. #else
  34. unsigned size = 16*320;
  35. unsigned nblocks = 16;
  36. unsigned nbigblocks = 2;
  37. #endif
  38. unsigned noprio = 0;
  39. unsigned check = 0;
  40. unsigned display = 0;
  41. int dblockx = -1;
  42. int dblocky = -1;
  43. void parse_args(int argc, char **argv, int nodes)
  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], "-dblockx") == 0)
  54. {
  55. char *argptr;
  56. dblockx = strtol(argv[++i], &argptr, 10);
  57. }
  58. if (strcmp(argv[i], "-dblocky") == 0)
  59. {
  60. char *argptr;
  61. dblocky = strtol(argv[++i], &argptr, 10);
  62. }
  63. if (strcmp(argv[i], "-nblocks") == 0)
  64. {
  65. char *argptr;
  66. nblocks = strtol(argv[++i], &argptr, 10);
  67. }
  68. if (strcmp(argv[i], "-nbigblocks") == 0)
  69. {
  70. char *argptr;
  71. nbigblocks = strtol(argv[++i], &argptr, 10);
  72. }
  73. if (strcmp(argv[i], "-no-prio") == 0)
  74. {
  75. noprio = 1;
  76. }
  77. if (strcmp(argv[i], "-check") == 0)
  78. {
  79. check = 1;
  80. }
  81. if (strcmp(argv[i], "-display") == 0)
  82. {
  83. display = 1;
  84. }
  85. if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "--help") == 0)
  86. {
  87. printf("usage : %s [-size size] [-nblocks nblocks] [-no-prio] [-display] [-check]\n", argv[0]);
  88. }
  89. }
  90. #ifdef STARPU_HAVE_VALGRIND_H
  91. if (RUNNING_ON_VALGRIND)
  92. size = 16;
  93. #endif
  94. if (nblocks > size)
  95. nblocks = size;
  96. if (dblockx == -1 || dblocky == -1)
  97. {
  98. int factor;
  99. dblockx = nodes;
  100. dblocky = 1;
  101. for(factor=sqrt(nodes) ; factor>1 ; factor--)
  102. {
  103. if (nodes % factor == 0)
  104. {
  105. dblockx = nodes/factor;
  106. dblocky = factor;
  107. break;
  108. }
  109. }
  110. }
  111. FPRINTF(stdout, "size: %u - nblocks: %u - dblocksx: %d - dblocksy: %d\n", size, nblocks, dblockx, dblocky);
  112. }