|
@@ -0,0 +1,145 @@
|
|
|
+/* StarPU --- Runtime system for heterogeneous multicore architectures.
|
|
|
+ *
|
|
|
+ * Copyright (C) 2011, 2012, 2013, 2014 Centre National de la Recherche Scientifique
|
|
|
+ *
|
|
|
+ * StarPU is free software; you can redistribute it and/or modify
|
|
|
+ * it under the terms of the GNU Lesser General Public License as published by
|
|
|
+ * the Free Software Foundation; either version 2.1 of the License, or (at
|
|
|
+ * your option) any later version.
|
|
|
+ *
|
|
|
+ * StarPU is distributed in the hope that it will be useful, but
|
|
|
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
+ *
|
|
|
+ * See the GNU Lesser General Public License in COPYING.LGPL for more details.
|
|
|
+ */
|
|
|
+
|
|
|
+#include <common/config.h>
|
|
|
+#include <starpu.h>
|
|
|
+#include <starpu_mpi.h>
|
|
|
+#include <math.h>
|
|
|
+#include "helper.h"
|
|
|
+
|
|
|
+#if !defined(STARPU_HAVE_SETENV)
|
|
|
+#warning setenv is not defined. Skipping test
|
|
|
+int main(int argc, char **argv)
|
|
|
+{
|
|
|
+ return STARPU_TEST_SKIPPED;
|
|
|
+}
|
|
|
+#else
|
|
|
+
|
|
|
+void func_cpu(STARPU_ATTRIBUTE_UNUSED void *descr[], STARPU_ATTRIBUTE_UNUSED void *_args)
|
|
|
+{
|
|
|
+}
|
|
|
+
|
|
|
+struct starpu_codelet mycodelet =
|
|
|
+{
|
|
|
+ .cpu_funcs = {func_cpu, NULL},
|
|
|
+ .nbuffers = 2,
|
|
|
+ .modes = {STARPU_RW, STARPU_R}
|
|
|
+};
|
|
|
+
|
|
|
+#define N 1000
|
|
|
+
|
|
|
+/* Returns the MPI node number where data indexes index is */
|
|
|
+int my_distrib(int x)
|
|
|
+{
|
|
|
+ return x;
|
|
|
+}
|
|
|
+
|
|
|
+void test_cache(int rank, int size, char *enabled, size_t *comm_amount)
|
|
|
+{
|
|
|
+ int i;
|
|
|
+ int ret;
|
|
|
+ unsigned v[2][N];
|
|
|
+ starpu_data_handle_t data_handles[2];
|
|
|
+
|
|
|
+ FPRINTF_MPI("Testing with STARPU_MPI_CACHE=%s\n", enabled);
|
|
|
+ setenv("STARPU_MPI_CACHE", enabled, 1);
|
|
|
+
|
|
|
+ ret = starpu_init(NULL);
|
|
|
+ STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
|
|
|
+ ret = starpu_mpi_init(NULL, NULL, 0);
|
|
|
+ STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init");
|
|
|
+
|
|
|
+ for(i = 0; i < 2; i++)
|
|
|
+ {
|
|
|
+ int mpi_rank = my_distrib(i);
|
|
|
+ if (mpi_rank == rank)
|
|
|
+ {
|
|
|
+ starpu_vector_data_register(&data_handles[i], STARPU_MAIN_RAM, (uintptr_t)&(v[i]), N, sizeof(unsigned));
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ /* I don't own that index, but will need it for my computations */
|
|
|
+ starpu_vector_data_register(&data_handles[i], -1, (uintptr_t)NULL, N, sizeof(unsigned));
|
|
|
+ }
|
|
|
+ starpu_data_set_rank(data_handles[i], mpi_rank);
|
|
|
+ starpu_data_set_tag(data_handles[i], i);
|
|
|
+ }
|
|
|
+
|
|
|
+ // We call starpu_mpi_task_insert twice, when the cache is enabled, the 1st time puts the
|
|
|
+ // data in the cache, the 2nd time allows to check the data is not sent again
|
|
|
+ for(i = 0; i < 2; i++)
|
|
|
+ {
|
|
|
+ ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet, STARPU_RW, data_handles[0], STARPU_R, data_handles[1], 0);
|
|
|
+ STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_task_insert");
|
|
|
+ }
|
|
|
+
|
|
|
+ // Flush the cache for data_handles[1] which has been sent from node1 to node0
|
|
|
+ starpu_mpi_cache_flush(MPI_COMM_WORLD, data_handles[1]);
|
|
|
+
|
|
|
+ // Check again
|
|
|
+ for(i = 0; i < 2; i++)
|
|
|
+ {
|
|
|
+ ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet, STARPU_RW, data_handles[0], STARPU_R, data_handles[1], 0);
|
|
|
+ STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_task_insert");
|
|
|
+ }
|
|
|
+
|
|
|
+ starpu_task_wait_for_all();
|
|
|
+
|
|
|
+ for(i = 0; i < 2; i++)
|
|
|
+ {
|
|
|
+ starpu_data_unregister(data_handles[i]);
|
|
|
+ }
|
|
|
+
|
|
|
+ starpu_mpi_comm_amounts_retrieve(comm_amount);
|
|
|
+ starpu_mpi_shutdown();
|
|
|
+ starpu_shutdown();
|
|
|
+}
|
|
|
+
|
|
|
+int main(int argc, char **argv)
|
|
|
+{
|
|
|
+ int rank, size;
|
|
|
+ int result=0;
|
|
|
+ size_t *comm_amount_with_cache;
|
|
|
+ size_t *comm_amount_without_cache;
|
|
|
+
|
|
|
+ MPI_Init(&argc, &argv);
|
|
|
+ MPI_Comm_rank(MPI_COMM_WORLD, &rank);
|
|
|
+ MPI_Comm_size(MPI_COMM_WORLD, &size);
|
|
|
+
|
|
|
+ setenv("STARPU_COMM_STATS", "1", 1);
|
|
|
+ setenv("STARPU_MPI_CACHE_STATS", "1", 1);
|
|
|
+
|
|
|
+ comm_amount_with_cache = malloc(size * sizeof(size_t));
|
|
|
+ comm_amount_without_cache = malloc(size * sizeof(size_t));
|
|
|
+
|
|
|
+ test_cache(rank, size, "0", comm_amount_with_cache);
|
|
|
+ test_cache(rank, size, "1", comm_amount_without_cache);
|
|
|
+
|
|
|
+ if (rank == 1)
|
|
|
+ {
|
|
|
+ result = (comm_amount_with_cache[0] == comm_amount_without_cache[0] * 2);
|
|
|
+ FPRINTF_MPI("Communication cache mechanism is %sworking (with cache: %d) (without cache: %d)\n", result?"":"NOT ", comm_amount_with_cache[0], comm_amount_without_cache[0]);
|
|
|
+ }
|
|
|
+ else
|
|
|
+ result = 1;
|
|
|
+
|
|
|
+ free(comm_amount_without_cache);
|
|
|
+ free(comm_amount_with_cache);
|
|
|
+
|
|
|
+ MPI_Finalize();
|
|
|
+ return !result;
|
|
|
+}
|
|
|
+#endif
|