Bee online demonstrator
#define N 100 int main(void) { int a[N]; int i,result; #pragma begin_scop for(i=0; i<N; i++) #pragma schedule[i] a[i] = 1; for(i=0; i<N; i++) #pragma schedule[i+4] result = a[i]; #pragma end_scop return result; }
Heuristic:
H1, successive minima
H2, scaled basis
H3 ai, dual scaled basis I
H3 ci, dual scaled basis II
Optimal --> lower bound: