empty_task.c 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009, 2010-2011, 2014, 2016 Université de Bordeaux
  4. * Copyright (C) 2010, 2011, 2012, 2013 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 <stdio.h>
  18. #include <unistd.h>
  19. #include <starpu.h>
  20. #include "../helper.h"
  21. /*
  22. * Measure the cost of a task with a NULL codelet
  23. */
  24. #ifdef STARPU_QUICK_CHECK
  25. static unsigned ntasks = 64;
  26. #else
  27. static unsigned ntasks = 65536;
  28. #endif
  29. static void usage(char **argv)
  30. {
  31. FPRINTF(stderr, "%s [-i ntasks] [-h]\n", argv[0]);
  32. exit(-1);
  33. }
  34. static void parse_args(int argc, char **argv)
  35. {
  36. int c;
  37. while ((c = getopt(argc, argv, "i:t:h")) != -1)
  38. switch(c)
  39. {
  40. case 'i':
  41. ntasks = atoi(optarg);
  42. break;
  43. case 'h':
  44. usage(argv);
  45. break;
  46. }
  47. }
  48. int main(int argc, char **argv)
  49. {
  50. int ret;
  51. double timing;
  52. double start;
  53. double end;
  54. parse_args(argc, argv);
  55. ret = starpu_initialize(NULL, &argc, &argv);
  56. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  57. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  58. FPRINTF(stderr, "#tasks : %u\n", ntasks);
  59. start = starpu_timing_now();
  60. unsigned i;
  61. for (i = 0; i < ntasks; i++)
  62. {
  63. struct starpu_task *task = starpu_task_create();
  64. task->cl = NULL;
  65. task->detach = 0;
  66. task->destroy = 1;
  67. ret = starpu_task_submit(task);
  68. if (ret == -ENODEV) goto enodev;
  69. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  70. ret = starpu_task_wait(task);
  71. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait");
  72. }
  73. end = starpu_timing_now();
  74. timing = end - start;
  75. FPRINTF(stderr, "Total: %f secs\n", timing/1000000);
  76. FPRINTF(stderr, "Per task: %f usecs\n", timing/ntasks);
  77. starpu_shutdown();
  78. return EXIT_SUCCESS;
  79. enodev:
  80. fprintf(stderr, "WARNING: No one can execute this task\n");
  81. /* yes, we do not perform the computation but we did detect that no one
  82. * could perform the kernel, so this is not an error from StarPU */
  83. starpu_shutdown();
  84. return STARPU_TEST_SKIPPED;
  85. }