We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent d3a5c85 commit 6f7b5eeCopy full SHA for 6f7b5ee
content/english/hpc/pipelining/throughput.md
@@ -41,7 +41,7 @@ But we can go higher than that. The *throughput* of `add`[^throughput] is 2 on m
41
The solution is to use *two* accumulators and just sum up odd and and even elements separately:
42
43
```c++
44
-int s0 = 0, s1 = 1;
+int s0 = 0, s1 = 0;
45
s0 += a[0];
46
s1 += a[1];
47
s0 += a[2];
0 commit comments