|
|
@@ -0,0 +1,142 @@
|
|
|
+/* StarPU --- Runtime system for heterogeneous multicore architectures.
|
|
|
+ *
|
|
|
+ * Copyright (C) 2016 Bérangère Subervie
|
|
|
+ *
|
|
|
+ * 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 <stdbool.h>
|
|
|
+#include <starpu.h>
|
|
|
+#include "../helper.h"
|
|
|
+
|
|
|
+#define TIME 0.010
|
|
|
+#define TASK_COEFFICIENT 10
|
|
|
+#define DATA_COEFFICIENT 10.5
|
|
|
+#define MARGIN 0.05
|
|
|
+#define SECONDS_SCALE_COEFFICIENT_TIMING_NOW 1000000
|
|
|
+#define NB_FLOAT 4000000
|
|
|
+
|
|
|
+void wait(void *descr[] STARPU_ATTRIBUTE_UNUSED, void *_args){
|
|
|
+ starpu_sleep(TIME);
|
|
|
+}
|
|
|
+
|
|
|
+double cost_function(struct starpu_task *t, struct starpu_perfmodel_arch *a, unsigned i)
|
|
|
+{
|
|
|
+ return TIME * 1000000;
|
|
|
+}
|
|
|
+
|
|
|
+static struct starpu_perfmodel perf_model =
|
|
|
+{
|
|
|
+ .type = STARPU_PER_ARCH,
|
|
|
+ .arch_cost_function = cost_function,
|
|
|
+};
|
|
|
+
|
|
|
+
|
|
|
+static struct starpu_codelet cl =
|
|
|
+{
|
|
|
+ .cpu_funcs = { wait },
|
|
|
+ .cuda_funcs = { wait },
|
|
|
+ .opencl_funcs = { wait },
|
|
|
+ .cpu_funcs_name = { "wait" },
|
|
|
+ .nbuffers = 1,
|
|
|
+ .modes = {STARPU_RW},
|
|
|
+ .flags = STARPU_CODELET_SIMGRID_EXECUTE,
|
|
|
+ .model = &perf_model,
|
|
|
+};
|
|
|
+
|
|
|
+int main(int argc, char *argv[]){
|
|
|
+
|
|
|
+ int ret;
|
|
|
+
|
|
|
+ ret = starpu_initialize(NULL, &argc, &argv);
|
|
|
+ if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
|
|
|
+ STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
|
|
|
+
|
|
|
+ unsigned nb_tasks, nb_data, nb_workers;
|
|
|
+ double begin_time, end_time, time_m, time_s, speed_up, expected_speed_up, percentage_expected_speed_up;
|
|
|
+ bool check, check_sup;
|
|
|
+
|
|
|
+ nb_workers = starpu_worker_get_count_by_type(STARPU_CPU_WORKER) + starpu_worker_get_count_by_type(STARPU_CUDA_WORKER) + starpu_worker_get_count_by_type(STARPU_OPENCL_WORKER);
|
|
|
+ nb_tasks = nb_workers*TASK_COEFFICIENT*DATA_COEFFICIENT;
|
|
|
+ nb_data = nb_workers*DATA_COEFFICIENT;
|
|
|
+
|
|
|
+ /* We consider a vector of float that is initialized just as any of C
|
|
|
+ * data */
|
|
|
+ float *vector[nb_data];
|
|
|
+ starpu_data_handle_t vector_handle[nb_data];
|
|
|
+ unsigned i,j;
|
|
|
+ for (j = 0; j < nb_data; j++)
|
|
|
+ {
|
|
|
+ vector[j] = malloc(NB_FLOAT * sizeof(float));
|
|
|
+#ifndef STARPU_SIMGRID
|
|
|
+ for (i = 0; i < NB_FLOAT; i++)
|
|
|
+ vector[j][i] = (i+1.0f);
|
|
|
+#endif
|
|
|
+
|
|
|
+ /* Tell StaPU to associate the "vector" vector with the "vector_handle"
|
|
|
+ * identifier. When a task needs to access a piece of data, it should
|
|
|
+ * refer to the handle that is associated to it.
|
|
|
+ * In the case of the "vector" data interface:
|
|
|
+ * - the first argument of the registration method is a pointer to the
|
|
|
+ * handle that should describe the data
|
|
|
+ * - the second argument is the memory node where the data (ie. "vector")
|
|
|
+ * resides initially: STARPU_MAIN_RAM stands for an address in main memory, as
|
|
|
+ * opposed to an adress on a GPU for instance.
|
|
|
+ * - the third argument is the adress of the vector in RAM
|
|
|
+ * - the fourth argument is the number of elements in the vector
|
|
|
+ * - the fifth argument is the size of each element.
|
|
|
+ */
|
|
|
+ starpu_vector_data_register(&vector_handle[j], STARPU_MAIN_RAM, (uintptr_t)vector[j], NB_FLOAT, sizeof(vector[0][0]));
|
|
|
+ }
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+ begin_time = starpu_timing_now();
|
|
|
+
|
|
|
+ /*execution des tasks*/
|
|
|
+
|
|
|
+ for (i=0; i<nb_tasks; i++)
|
|
|
+ starpu_task_insert(&cl, STARPU_RW, vector_handle[i%nb_data], 0);
|
|
|
+ for (i=0; i<nb_data; i++)
|
|
|
+ starpu_data_wont_use(vector_handle[i]);
|
|
|
+
|
|
|
+ starpu_task_wait_for_all();
|
|
|
+
|
|
|
+ end_time = starpu_timing_now();
|
|
|
+
|
|
|
+ for (j = 0; j < nb_data; j++)
|
|
|
+ starpu_data_unregister(vector_handle[j]);
|
|
|
+
|
|
|
+ /*on determine si le temps mesure est satisfaisant ou pas*/
|
|
|
+
|
|
|
+ time_m = (end_time - begin_time)/SECONDS_SCALE_COEFFICIENT_TIMING_NOW; //pour ramener en secondes
|
|
|
+ time_s = nb_tasks * TIME;
|
|
|
+ speed_up = time_s/time_m;
|
|
|
+ expected_speed_up = nb_workers;
|
|
|
+ percentage_expected_speed_up = 100 * (speed_up/expected_speed_up);
|
|
|
+ check = speed_up >= ((1 - MARGIN) * expected_speed_up);
|
|
|
+ check_sup = speed_up <= ((1 + MARGIN) * expected_speed_up);
|
|
|
+
|
|
|
+ printf("measured time = %f seconds\nsequential time = %f seconds\nspeed up = %f\nnumber of workers = %d\nnumber of tasks = %d\nexpected speed up = %f\npercentage of expected speed up %.2f%%\n", time_m, time_s, speed_up, nb_workers, nb_tasks, expected_speed_up, percentage_expected_speed_up);
|
|
|
+
|
|
|
+ starpu_shutdown();
|
|
|
+ for (j = 0; j < nb_data; j++)
|
|
|
+ free(vector[j]);
|
|
|
+
|
|
|
+ if (check && check_sup){ //test reussi ou test echoue
|
|
|
+ return EXIT_SUCCESS;
|
|
|
+ }
|
|
|
+ else{
|
|
|
+ return EXIT_FAILURE;
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
