X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/4a201b7ceece70d2bc461ac48c8b746a36d07243..187ba0c05f9fbe51175179b9f637b6554f947468:/examples/gras/chrono/chrono.c?ds=sidebyside

diff --git a/examples/gras/chrono/chrono.c b/examples/gras/chrono/chrono.c
deleted file mode 100644
index 4b530c5823..0000000000
--- a/examples/gras/chrono/chrono.c
+++ /dev/null
@@ -1,84 +0,0 @@
-/* chrono - demo of GRAS benchmarking features                              */
-
-/* Copyright (c) 2005 Martin Quinson, Arnaud Legrand. All rights reserved.  */
-
-/* This program is free software; you can redistribute it and/or modify it
- * under the terms of the license (GNU LGPL) which comes with this package. */
-
-#include "gras.h"
-#include "xbt/log.h"
-
-XBT_LOG_NEW_DEFAULT_CATEGORY(Chrono, "Messages specific to this example");
-
-
-/* Function prototypes */
-int multiplier(int argc, char *argv[]);
-
-int multiplier(int argc, char *argv[])
-{
-  int i, j, k, l;
-  double *A, *B, *C;
-  int n = 100;
-  double start = 0.0;
-  double now = 0.0;
-
-  gras_init(&argc, argv);
-
-  A = malloc(n * n * sizeof(double));
-  B = malloc(n * n * sizeof(double));
-  C = malloc(n * n * sizeof(double));
-
-  start = now = gras_os_time();
-
-  INFO1("Begin matrix multiplication loop (time: %g)", start);
-
-  for (l = 0; l < 4; l++) {
-    now = gras_os_time();
-    GRAS_BENCH_ONCE_RUN_ONCE_BEGIN();
-    for (i = 0; i < n; i++)
-      for (j = 0; j < n; j++) {
-        A[i * n + j] = 2 / n;
-        B[i * n + j] = 1 / n;
-        C[i * n + j] = 0.0;
-      }
-
-    for (i = 0; i < n; i++)
-      for (j = 0; j < n; j++)
-        for (k = 0; k < n; k++)
-          C[i * n + j] += A[i * n + k] * B[k * n + j];
-
-    GRAS_BENCH_ONCE_RUN_ONCE_END();
-    now = gras_os_time() - now;
-    INFO2("Iteration %d : %g ", l, now);
-  }
-
-  now = gras_os_time() - start;
-  INFO2("End matrix multiplication loop (time: %g; Duration: %g)",
-        gras_os_time(), now);
-
-  start = now = gras_os_time();
-  INFO1("Begin malloc loop (time: %g)", start);
-  for (l = 0; l < 4; l++) {
-    now = gras_os_time();
-    GRAS_BENCH_ONCE_RUN_ONCE_BEGIN();
-    free(A);
-    A = malloc(n * n * sizeof(double));
-    GRAS_BENCH_ONCE_RUN_ONCE_END();
-    now = gras_os_time() - now;
-    INFO2("Iteration %d : %g ", l, now);
-  }
-
-  start = now = gras_os_time();
-  INFO1("Begin integer incrementation loop (time: %g)", start);
-  for (l = 0; l < 4; l++) {
-    GRAS_BENCH_ONCE_RUN_ONCE_BEGIN();
-    j++;
-    GRAS_BENCH_ONCE_RUN_ONCE_END();
-  }
-  free(A);
-  free(B);
-  free(C);
-
-  gras_exit();
-  return 0;
-}