mpi_decomposition_params.c 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009, 2010, 2015-2017 Université de Bordeaux
  4. * Copyright (C) 2010, 2011, 2012, 2013, 2015, 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 "mpi_cholesky.h"
  18. #include <string.h>
  19. #include <stdlib.h>
  20. #include <stdio.h>
  21. #include <math.h>
  22. #ifdef STARPU_QUICK_CHECK
  23. unsigned size = 4*64;
  24. unsigned nblocks = 2;
  25. unsigned nbigblocks = 2;
  26. #elif !defined(STARPU_LONG_CHECK)
  27. unsigned size = 4*320;
  28. unsigned nblocks = 4;
  29. unsigned nbigblocks = 2;
  30. #else
  31. unsigned size = 16*320;
  32. unsigned nblocks = 16;
  33. unsigned nbigblocks = 2;
  34. #endif
  35. unsigned noprio = 0;
  36. unsigned display = 0;
  37. int dblockx = -1;
  38. int dblocky = -1;
  39. void parse_args(int argc, char **argv, int nodes)
  40. {
  41. int i;
  42. for (i = 1; i < argc; i++)
  43. {
  44. if (strcmp(argv[i], "-size") == 0)
  45. {
  46. char *argptr;
  47. size = strtol(argv[++i], &argptr, 10);
  48. }
  49. if (strcmp(argv[i], "-dblockx") == 0)
  50. {
  51. char *argptr;
  52. dblockx = strtol(argv[++i], &argptr, 10);
  53. }
  54. if (strcmp(argv[i], "-dblocky") == 0)
  55. {
  56. char *argptr;
  57. dblocky = strtol(argv[++i], &argptr, 10);
  58. }
  59. if (strcmp(argv[i], "-nblocks") == 0)
  60. {
  61. char *argptr;
  62. nblocks = strtol(argv[++i], &argptr, 10);
  63. }
  64. if (strcmp(argv[i], "-nbigblocks") == 0)
  65. {
  66. char *argptr;
  67. nbigblocks = strtol(argv[++i], &argptr, 10);
  68. }
  69. if (strcmp(argv[i], "-no-prio") == 0)
  70. {
  71. noprio = 1;
  72. }
  73. if (strcmp(argv[i], "-display") == 0)
  74. {
  75. display = 1;
  76. }
  77. if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "--help") == 0)
  78. {
  79. printf("usage : %s [-display] [-size size] [-nblocks nblocks]\n", argv[0]);
  80. }
  81. }
  82. if (nblocks > size)
  83. nblocks = size;
  84. if (dblockx == -1 || dblocky == -1)
  85. {
  86. int factor;
  87. dblockx = nodes;
  88. dblocky = 1;
  89. for(factor=sqrt(nodes) ; factor>1 ; factor--)
  90. {
  91. if (nodes % factor == 0)
  92. {
  93. dblockx = nodes/factor;
  94. dblocky = factor;
  95. break;
  96. }
  97. }
  98. }
  99. FPRINTF(stdout, "size: %u - nblocks: %u - dblocksx: %d - dblocksy: %d\n", size, nblocks, dblockx, dblocky);
  100. }