\([1,6,56,361,2,45]\)
flowchart TB
subgraph A["Schedule A: cores finish 1 → 2 → 3"]
direction TB
A1["Core 1: a"]
A2["Core 2: b"]
A3["Core 3: c"]
A4["(a+b)"]
A5["(a+b)+c = 1.23"]
A1 --> A4
A2 --> A4
A4 --> A5
A3 --> A5
end
subgraph B["Schedule B: cores finish 3 → 2 → 1"]
direction TB
B1["Core 1: a"]
B2["Core 2: b"]
B3["Core 3: c"]
B4["(b+c)"]
B5["a+(b+c) = 0"]
B2 --> B4
B3 --> B4
B1 --> B5
B4 --> B5
end
Same inputs (a, b, c); different completion order → different reduction → different result.
Batch of 5 prompts; max length = 5 tokens → 5×5 matrix. Shorter prompts padded with PAD.
| 0 | 1 | 2 | 3 | 4 | |
|---|---|---|---|---|---|
| prompt 0 | 42 | 89 | PAD | PAD | PAD |
| prompt 1 | 12 | 77 | 234 | 891 | PAD |
| prompt 2 | 301 | PAD | PAD | PAD | PAD |
| prompt 3 | 55 | 23 | 1024 | 88 | PAD |
| prompt 4 | 7 | 1024 | 156 | 302 | 445 |
Columns = token positions (fixed by longest prompt). Rows = batch dimension. PAD cells are masked out in attention.