[Taniwha]

Unlike just reading a bunch of random data the read instructions can't be pipelined, the instruction that uses the read pointer can't be dispatched to the load-store unit until after it's address has arrived in the CPU (two reads where you know the address can just be queued, and even finished out of order if the second one hits in a closer cache than the first one)

[fulafel]

I think you are describing the pessimal pointer chasing case, that should be the smaller figure.

[Taniwha]

More I'm trying to explain why pointer chasing is going to be slower than random integer accesses

[fulafel]

Yes, it should be lower. Yet there is a lower figure estimated for a mixed worlkoad.

"A more realistic application might consume 5 GB/s at 144 Hz which is just 69 MB per frame."

But, now I see what it's about: tje 7 GB/s figure is for 6 threads, for 1 thread he gets 2 GB/s.