Sha256: cc9ba828780babff0fbd62d46c39c6100a4d0daa7ab07b9c7cb55e14555b598d
Contents?: true
Size: 1.64 KB
Versions: 2
Compression:
Stored size: 1.64 KB
Contents
// // This file is part of the Bones source-to-source compiler examples. The C-code // is largely identical in terms of functionality and variable naming to the code // found in PolyBench/C version 3.2. For more information on PolyBench/C or Bones // please use the contact information below. // // == More information on PolyBench/C // Contact............Louis-Noel Pouchet <pouchet@cse.ohio-state.edu> // Web address........http://polybench.sourceforge.net/ // // == More information on Bones // Contact............Cedric Nugteren <c.nugteren@tue.nl> // Web address........http://parse.ele.tue.nl/bones/ // // == File information // Filename...........benchmark/syrk.c // Author.............Cedric Nugteren // Last modified on...07-May-2013 // #include "common.h" // This is 'syrk', an algorithm for symmetric rank-k operations int main(void) { int i,j,k; // Declare arrays on the stack float A[NI][NJ]; float C[NI][NI]; // Set the constants float alpha = 32412; float beta = 2123; // Set the input data /* for (i=0; i<NI; i++) { for (j=0; j<NJ; j++) { A[i][j] = ((float) i*j) / NI; } } for (i=0; i<NI; i++) { for (j=0; j<NI; j++) { C[i][j] = ((float) i*j) / NI; } } */ // Perform the computation (C := alpha*A*A' + beta*C) #pragma scop #pragma species kernel C[0:NI-1,0:NI-1]|element ^ A[0:NI-1,0:NJ-1]|chunk(0:0,0:NJ-1) -> C[0:NI-1,0:NI-1]|element for (i=0; i<NI; i++) { for (j=0; j<NI; j++) { C[i][j] *= beta; for (k=0; k<NJ; k++) { C[i][j] += alpha * A[i][k] * A[j][k]; } } } #pragma species endkernel syrk #pragma endscop // Clean-up and exit the function fflush(stdout); C[8][9] = C[8][9]; return 0; }
Version data entries
2 entries across 2 versions & 1 rubygems
Version | Path |
---|---|
bones-compiler-1.6.0 | examples/benchmarks/PolyBench/syrk.c |
bones-compiler-1.3.1 | examples/benchmarks/PolyBench/syrk.c |