Task-Level Data Model for Hardware Synthesis Based on Concurrent Collections

Listing 13

Example C-code of tiled Cholesky.

1 int i, j, k;

2 data_type A[p][p][p+1];

3 for (k=0; k<p; k++) {

4  seqCholesky (A[k][k][k+1]←A[k][k][k]);

5  for (j=k+1; j<p; j++) {

6   TriSolve(A[j][k][k+1]←A[j][k][k], A[k][k][k+1]);

7   for (i=k+1; i<=j; i++) {

8    Update (A[j][i][k+1]←A[j][k][k+1], A[i][k][k+1]);

9}

10}

11}