|
@@ -0,0 +1,142 @@
|
|
|
+/*
|
|
|
+ * StarPU
|
|
|
+ * Copyright (C) INRIA 2008-2010 (see AUTHORS file)
|
|
|
+ *
|
|
|
+ * This program 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.
|
|
|
+ *
|
|
|
+ * This program 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 <starpu.h>
|
|
|
+#include <stdio.h>
|
|
|
+
|
|
|
+#define NTASKS (32*1024)
|
|
|
+#define NSHOT_PER_TASK 1024
|
|
|
+
|
|
|
+#define SIZE (NTASKS*NSHOT_PER_TASK)
|
|
|
+
|
|
|
+#define TYPE float
|
|
|
+
|
|
|
+static void cpu_kernel(void *descr[], void *cl_arg)
|
|
|
+{
|
|
|
+ TYPE *random_numbers_x = (TYPE *)STARPU_GET_VECTOR_PTR(descr[0]);
|
|
|
+ TYPE *random_numbers_y = (TYPE *)STARPU_GET_VECTOR_PTR(descr[1]);
|
|
|
+ unsigned nx = STARPU_GET_VECTOR_NX(descr[0]);
|
|
|
+
|
|
|
+ unsigned current_cnt = 0;
|
|
|
+
|
|
|
+ unsigned i;
|
|
|
+ for (i = 0; i < nx; i++)
|
|
|
+ {
|
|
|
+ TYPE x = random_numbers_x[i];
|
|
|
+ TYPE y = random_numbers_y[i];
|
|
|
+
|
|
|
+ TYPE dist = (x*x + y*y);
|
|
|
+
|
|
|
+ unsigned success = (dist <= 1.0);
|
|
|
+ current_cnt += success;
|
|
|
+ }
|
|
|
+
|
|
|
+ unsigned *cnt = (unsigned *)STARPU_GET_VECTOR_PTR(descr[2]);
|
|
|
+ *cnt = current_cnt;
|
|
|
+}
|
|
|
+
|
|
|
+int main(int argc, char **argv)
|
|
|
+{
|
|
|
+ unsigned i;
|
|
|
+
|
|
|
+ starpu_init(NULL);
|
|
|
+
|
|
|
+ TYPE *random_array_x;
|
|
|
+ starpu_malloc_pinned_if_possible((void **)&random_array_x, SIZE*sizeof(TYPE));
|
|
|
+ STARPU_ASSERT(random_array_x);
|
|
|
+
|
|
|
+ TYPE *random_array_y;
|
|
|
+ starpu_malloc_pinned_if_possible((void **)&random_array_y, SIZE*sizeof(TYPE));
|
|
|
+ STARPU_ASSERT(random_array_y);
|
|
|
+
|
|
|
+ unsigned *cnt_array;
|
|
|
+ starpu_malloc_pinned_if_possible((void **)&cnt_array, NTASKS*sizeof(unsigned));
|
|
|
+ STARPU_ASSERT(cnt_array);
|
|
|
+
|
|
|
+ /* First generate an array of random numbers */
|
|
|
+ for (i = 0; i < SIZE; i++)
|
|
|
+ {
|
|
|
+ random_array_x[i] = (((TYPE)rand()/(TYPE)RAND_MAX)*2.0 - 1.0);
|
|
|
+ random_array_y[i] = (((TYPE)rand()/(TYPE)RAND_MAX)*2.0 - 1.0);
|
|
|
+ }
|
|
|
+
|
|
|
+ /* Register the entire array */
|
|
|
+ starpu_data_handle random_array_handle_x;
|
|
|
+ starpu_register_vector_data(&random_array_handle_x, 0, (uintptr_t)random_array_x, SIZE, sizeof(TYPE));
|
|
|
+
|
|
|
+ starpu_data_handle random_array_handle_y;
|
|
|
+ starpu_register_vector_data(&random_array_handle_y, 0, (uintptr_t)random_array_y, SIZE, sizeof(TYPE));
|
|
|
+
|
|
|
+ starpu_data_handle cnt_array_handle;
|
|
|
+ starpu_register_vector_data(&cnt_array_handle, 0, (uintptr_t)cnt_array, NTASKS, sizeof(unsigned));
|
|
|
+
|
|
|
+ /* TODO use a write-back mechanism */
|
|
|
+
|
|
|
+ struct starpu_filter_t f = {
|
|
|
+ .filter_func = starpu_block_filter_func_vector,
|
|
|
+ .filter_arg = NTASKS
|
|
|
+ };
|
|
|
+
|
|
|
+ starpu_partition_data(random_array_handle_x, &f);
|
|
|
+ starpu_partition_data(random_array_handle_y, &f);
|
|
|
+ starpu_partition_data(cnt_array_handle, &f);
|
|
|
+
|
|
|
+ struct starpu_codelet_t cl = {
|
|
|
+ .where = STARPU_CPU,
|
|
|
+ .cpu_func = cpu_kernel,
|
|
|
+ .cuda_func = NULL, /* TODO */
|
|
|
+ .nbuffers = 3,
|
|
|
+ .model = NULL /* TODO */
|
|
|
+ };
|
|
|
+
|
|
|
+ for (i = 0; i < NTASKS; i++)
|
|
|
+ {
|
|
|
+ struct starpu_task *task = starpu_task_create();
|
|
|
+
|
|
|
+ task->cl = &cl;
|
|
|
+
|
|
|
+ task->buffers[0].handle = starpu_get_sub_data(random_array_handle_x, 1, i);
|
|
|
+ task->buffers[0].mode = STARPU_R;
|
|
|
+ task->buffers[1].handle = starpu_get_sub_data(random_array_handle_y, 1, i);
|
|
|
+ task->buffers[1].mode = STARPU_R;
|
|
|
+ task->buffers[2].handle = starpu_get_sub_data(cnt_array_handle, 1, i);
|
|
|
+ task->buffers[2].mode = STARPU_W;
|
|
|
+
|
|
|
+ int ret = starpu_submit_task(task);
|
|
|
+ STARPU_ASSERT(!ret);
|
|
|
+ }
|
|
|
+
|
|
|
+ starpu_wait_all_tasks();
|
|
|
+
|
|
|
+ /* Get the cnt_array back in main memory */
|
|
|
+ starpu_unpartition_data(cnt_array_handle, 0);
|
|
|
+ starpu_sync_data_with_mem(cnt_array_handle, STARPU_RW);
|
|
|
+
|
|
|
+ /* Count the total number of entries */
|
|
|
+ unsigned total_cnt = 0;
|
|
|
+ for (i = 0; i < NTASKS; i++)
|
|
|
+ total_cnt += cnt_array[i];
|
|
|
+
|
|
|
+ starpu_release_data_from_mem(cnt_array_handle);
|
|
|
+
|
|
|
+ starpu_shutdown();
|
|
|
+
|
|
|
+ /* Total surface : Pi * r^ 2 = Pi*1^2, total square surface : 2^2 = 4, probability to impact the disk: pi/4 */
|
|
|
+
|
|
|
+ fprintf(stderr, "Pi approximation : %f (%d / %d)\n", ((TYPE)total_cnt*4)/(SIZE), total_cnt, SIZE);
|
|
|
+
|
|
|
+ return 0;
|
|
|
+}
|