Loop-level parallelism: Difference between revisions

Revision as of 07:22, 24 March 2022

Revision as of 07:27, 24 March 2022

Line 10:

{{sxhl|lang=c|1=

for (int i = 0; i < n; ++i) {

S1: L[i] = L[i] += 10;

}

}}

Line 157:

for (int i = 1; i < n; ++i) {

S1: a[i] = a[i-1] + b[i];

S2: c[i] = c[i] += d[i];

}

}}

Line 166:

}

loop2: for (int i = 1; i < n; ++i) {

S2: c[i] = c[i] += d[i];

}

}}

Line 216:

{{sxhl|lang=c|1=

S1: int tmp = b[i] + 1;

S2: a[i] = a[i - 1] + tmp;

}}

Line 244:

for (int i = 1; i < n; ++i) {

S1: a[i] = a[i-1] + b[i];

S2: c[i] = c[i] += a[i];

}

}}

Line 260:

for (int i = 1; i < n; i++) {

wait(i);

S2: c[i] = c[i] += a[i];

}

}}