Re:Destroying x86_64 instruction decoders with differential ...
by roca on Thursday October 31, 2019 @03:36PM
(#21412741)
Right. Generally, memory accesses in real-world software are unpredictable enough (no matter how good the compiler is) that single-threaded execution is always going to get a big boost from OOO.
An interesting question is why Intel believed otherwise when they created IA64. I think there's a strong case that publication bias and other pathologies of academic compuer science destroyed billions of dollars in value, and would have killed Intel had it not had monopoly power.
Re:Destroying x86_64 instruction decoders with differential ...
by wolfgke on Thursday October 31, 2019 @04:01PM
(#21413074)
> An interesting question is why Intel believed otherwise when they created IA64.
For numerics code, VLIW can indeed offer huge advantages. Unluckily, computer programs from different areas have quite a different structure and thus do not profit from VLIW so much.
Re:Destroying x86_64 instruction decoders with differential ...
by cogman10 on Thursday October 31, 2019 @06:38PM
(#21414509)
I'm not too far in the know for how the OOO stuff works/worked within Paulson. Did OOO migrate instruction execution between batches? Did it simply ignore them all together?
I'd still imagine you'd see benefits for the same reason you see SIMD benefits (assuming you aren't doing a whole bunch of pointer chasing).
It comes down to memory latency. Even an L3 cache hit these days is 30-40 cycles. It’s hard to predict when loads and stores will miss the cache, so there is little a compiler can do to account for that in scheduling. OOO can cover the latency of an L3 cache hit pretty well. And once you add it for that, why not just pretend you’ve got a sequential machine?