ocladock-fpga issueshttps://git.esa.informatik.tu-darmstadt.de/docking/ocladock-fpga/-/issues2021-01-04T19:22:50Zhttps://git.esa.informatik.tu-darmstadt.de/docking/ocladock-fpga/-/issues/8Simplify Arbiter kernel2021-01-04T19:22:50ZLeonardo SolisSimplify Arbiter kernelFind out if `Krnl_IGL_SimplifArbiter.cl` reduces execution time.Find out if `Krnl_IGL_SimplifArbiter.cl` reduces execution time.Running on a Nallatech 510T platformLeonardo SolisLeonardo Solis2019-02-28https://git.esa.informatik.tu-darmstadt.de/docking/ocladock-fpga/-/issues/51Intel: evaluate if suitable: cl_intel_fpga_host_pipe2019-02-11T18:24:53ZLeonardo SolisIntel: evaluate if suitable: cl_intel_fpga_host_pipehttps://git.esa.informatik.tu-darmstadt.de/docking/ocladock-fpga/-/issues/49Intel: evaluate if suitable: #pragma max_concurrency2019-02-11T16:21:38ZLeonardo SolisIntel: evaluate if suitable: #pragma max_concurrencyExample:
```
#pragma max_concurrency 1
for (int i = 0; i < N; i++) {
int arr[M];
// Doing work on arr
}
```Example:
```
#pragma max_concurrency 1
for (int i = 0; i < N; i++) {
int arr[M];
// Doing work on arr
}
```https://git.esa.informatik.tu-darmstadt.de/docking/ocladock-fpga/-/issues/48Intel: evaluate if suitable: #pragma loop_coalesce2019-02-11T16:20:46ZLeonardo SolisIntel: evaluate if suitable: #pragma loop_coalesceExample:
```
#pragma loop_coalesce
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
sum[i][j] += i+j;
```Example:
```
#pragma loop_coalesce
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
sum[i][j] += i+j;
```