diff --git a/codes/syr2k/syr2k.c b/codes/syr2k/syr2k.c
new file mode 100644
index 0000000000000000000000000000000000000000..3ce38bf58213333122e3c14c7e4369b52d892314
--- /dev/null
+++ b/codes/syr2k/syr2k.c
@@ -0,0 +1,145 @@
+/**
+ * This version is stamped on May 10, 2016
+ *
+ * Contact:
+ * Louis-Noel Pouchet <pouchet.ohio-state.edu>
+ * Tomofumi Yuki <tomofumi.yuki.fr>
+ *
+ * Web address: http://polybench.sourceforge.net
+ */
+/* syr2k.c: this file is part of PolyBench/C */
+
+#include <stdio.h>
+#include <unistd.h>
+#include <string.h>
+#include <math.h>
+
+/* Include polybench common header. */
+#include <polybench.h>
+
+/* Include benchmark-specific header. */
+#include "syr2k.h"
+
+
+/* Array initialization. */
+static
+void init_array(int n, int m,
+ DATA_TYPE *alpha,
+ DATA_TYPE *beta,
+ DATA_TYPE POLYBENCH_2D(C,N,N,n,n),
+ DATA_TYPE POLYBENCH_2D(A,N,M,n,m),
+ DATA_TYPE POLYBENCH_2D(B,N,M,n,m))
+{
+ int i, j;
+
+ *alpha = 1.5;
+ *beta = 1.2;
+ for (i = 0; i < n; i++)
+ for (j = 0; j < m; j++) {
+ A[i][j] = (DATA_TYPE) ((i*j+1)%n) / n;
+ B[i][j] = (DATA_TYPE) ((i*j+2)%m) / m;
+ }
+ for (i = 0; i < n; i++)
+ for (j = 0; j < n; j++) {
+ C[i][j] = (DATA_TYPE) ((i*j+3)%n) / m;
+ }
+}
+
+
+/* DCE code. Must scan the entire live-out data.
+ Can be used also to check the correctness of the output. */
+static
+void print_array(int n,
+ DATA_TYPE POLYBENCH_2D(C,N,N,n,n))
+{
+ int i, j;
+
+ POLYBENCH_DUMP_START;
+ POLYBENCH_DUMP_BEGIN("C");
+ for (i = 0; i < n; i++)
+ for (j = 0; j < n; j++) {
+ if ((i * n + j) % 20 == 0) fprintf (POLYBENCH_DUMP_TARGET, "\n");
+ fprintf (POLYBENCH_DUMP_TARGET, DATA_PRINTF_MODIFIER, C[i][j]);
+ }
+ POLYBENCH_DUMP_END("C");
+ POLYBENCH_DUMP_FINISH;
+}
+
+
+/* Main computational kernel. The whole function will be timed,
+ including the call and return. */
+static
+void kernel_syr2k(int n, int m,
+ DATA_TYPE alpha,
+ DATA_TYPE beta,
+ DATA_TYPE POLYBENCH_2D(C,N,N,n,n),
+ DATA_TYPE POLYBENCH_2D(A,N,M,n,m),
+ DATA_TYPE POLYBENCH_2D(B,N,M,n,m))
+{
+ int i, j, k;
+
+//BLAS PARAMS
+//UPLO = 'L'
+//TRANS = 'N'
+//A is NxM
+//B is NxM
+//C is NxN
+#pragma scop
+ for (i = 0; i < _PB_N; i++) {
+ for (j = 0; j <= i; j++)
+ C[i][j] *= beta;
+ for (k = 0; k < _PB_M; k++)
+ for (j = 0; j <= i; j++)
+ {
+ C[i][j] += A[j][k]*alpha*B[i][k] + B[j][k]*alpha*A[i][k];
+ }
+ }
+#pragma endscop
+
+}
+
+
+int main(int argc, char** argv)
+{
+ /* Retrieve problem size. */
+ int n = N;
+ int m = M;
+
+ /* Variable declaration/allocation. */
+ DATA_TYPE alpha;
+ DATA_TYPE beta;
+ POLYBENCH_2D_ARRAY_DECL(C,DATA_TYPE,N,N,n,n);
+ POLYBENCH_2D_ARRAY_DECL(A,DATA_TYPE,N,M,n,m);
+ POLYBENCH_2D_ARRAY_DECL(B,DATA_TYPE,N,M,n,m);
+
+ /* Initialize array(s). */
+ init_array (n, m, &alpha, &beta,
+ POLYBENCH_ARRAY(C),
+ POLYBENCH_ARRAY(A),
+ POLYBENCH_ARRAY(B));
+
+ /* Start timer. */
+ polybench_start_instruments;
+
+ /* Run kernel. */
+ kernel_syr2k (n, m,
+ alpha, beta,
+ POLYBENCH_ARRAY(C),
+ POLYBENCH_ARRAY(A),
+ POLYBENCH_ARRAY(B));
+
+ /* Stop and print timer. */
+ polybench_stop_instruments;
+ polybench_print_instruments;
+
+ /* Prevent dead-code elimination. All live-out data must be printed
+ by the function call in argument. */
+ polybench_prevent_dce(print_array(n, POLYBENCH_ARRAY(C)));
+
+ /* Be clean. */
+ POLYBENCH_FREE_ARRAY(C);
+ POLYBENCH_FREE_ARRAY(A);
+ POLYBENCH_FREE_ARRAY(B);
+
+ return 0;
+}
diff --git a/codes/syr2k/syr2k.h b/codes/syr2k/syr2k.h
new file mode 100644
index 0000000000000000000000000000000000000000..7861bcd8e8d89957ce2a8f4c9ac2a0a1faa81b14
--- /dev/null
+++ b/codes/syr2k/syr2k.h
@@ -0,0 +1,80 @@
+/**
+ * This version is stamped on May 10, 2016
+ *
+ * Contact:
+ * Louis-Noel Pouchet <pouchet.ohio-state.edu>
+ * Tomofumi Yuki <tomofumi.yuki.fr>
+ *
+ * Web address: http://polybench.sourceforge.net
+ */
+#ifndef _SYR2K_H
+# define _SYR2K_H
+
+/* Default to LARGE_DATASET. */
+# if !defined(MINI_DATASET) && !defined(SMALL_DATASET) && !defined(MEDIUM_DATASET) && !defined(LARGE_DATASET) && !defined(EXTRALARGE_DATASET)
+# define LARGE_DATASET
+# endif
+
+# if !defined(M) && !defined(N)
+/* Define sample dataset sizes. */
+# ifdef MINI_DATASET
+# define M 20
+# define N 30
+# endif
+
+# ifdef SMALL_DATASET
+# define M 60
+# define N 80
+# endif
+
+# ifdef MEDIUM_DATASET
+# define M 200
+# define N 240
+# endif
+
+# ifdef LARGE_DATASET
+# define M 1000
+# define N 1200
+# endif
+
+# ifdef EXTRALARGE_DATASET
+# define M 2000
+# define N 2600
+# endif
+
+
+#endif /* !(M N) */
+
+# define _PB_M POLYBENCH_LOOP_BOUND(M,m)
+# define _PB_N POLYBENCH_LOOP_BOUND(N,n)
+
+
+/* Default data type */
+# if !defined(DATA_TYPE_IS_INT) && !defined(DATA_TYPE_IS_FLOAT) && !defined(DATA_TYPE_IS_DOUBLE)
+# define DATA_TYPE_IS_DOUBLE
+# endif
+
+#ifdef DATA_TYPE_IS_INT
+# define DATA_TYPE int
+# define DATA_PRINTF_MODIFIER "%d "
+#endif
+
+#ifdef DATA_TYPE_IS_FLOAT
+# define DATA_TYPE float
+# define DATA_PRINTF_MODIFIER "%0.2f "
+# define SCALAR_VAL(x) x##f
+# define SQRT_FUN(x) sqrtf(x)
+# define EXP_FUN(x) expf(x)
+# define POW_FUN(x,y) powf(x,y)
+# endif
+
+#ifdef DATA_TYPE_IS_DOUBLE
+# define DATA_TYPE double
+# define DATA_PRINTF_MODIFIER "%0.2lf "
+# define SCALAR_VAL(x) x
+# define SQRT_FUN(x) sqrt(x)
+# define EXP_FUN(x) exp(x)
+# define POW_FUN(x,y) pow(x,y)
+# endif
+
+#endif /* !_SYR2K_H */